TU Berlin

Research Group Algorithmics and Computational Complexityvip routing

isti-logo

Page Content

to Navigation

Conference paper

Till Fluschnik and Stefan Kratsch and Rolf Niedermeier and Manuel Sorge.
The Parameterized Complexity of the Minimum Shared Edges Problem.
In Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS '15), pages 448–462. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.
Bibtex entry Link to publication
Link to original publication
Till Fluschnik and Stefan Kratsch and Rolf Niedermeier and Manuel Sorge.
The Parameterized Complexity of the Minimum Shared Edges Problem.
In Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS '15), pages 448–462. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.
Bibtex entry Link to publication
Link to original publication

To top

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe