The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Till Fluschnik" ( http://dblp.L3S.de/Authors/Till_Fluschnik )

  Author page on DBLP  Author page in RDF  Community of Till Fluschnik in ASPL-2

Publication years (Num. hits)
2015-2017 (21) 2018-2019 (23) 2020 (1)
Publication types (Num. hits)
article(30) inproceedings(15)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 46 publication records. Showing 45 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier The complexity of finding small separators in temporal graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz Exact mean computation in dynamic time warping spaces. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When Can Graph Hyperbolicity be Computed in Linear Time? Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The parameterized complexity of the minimum shared edges problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The complexity of routing with collision avoidance. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier Parameterized aspects of triangle enumeration. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche Multistage Vertex Cover. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Search on Bibsonomy Networks The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. Search on Bibsonomy MOTOR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker Fair Knapsack. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier Fractals for Kernelization Lower Bounds. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko On (1+ε)-approximate problem kernels for the Rural Postman Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Max-Jonathan Luckow, Till Fluschnik On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche Temporal Graph Classes: A View Through Temporal Separators. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko Parameterized algorithms and data reduction for safe convoy routing. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Search on Bibsonomy Discrete Optimization The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko Parameterized Algorithms and Data Reduction for Safe Convoy Routing. Search on Bibsonomy ATMOS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz Exact Mean Computation in Dynamic Time Warping Spaces. Search on Bibsonomy SDM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier The Complexity of Finding Small Separators in Temporal Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche Temporal Graph Classes: A View Through Temporal Separators. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier Diminishable Parameterized Problems and Strict Polynomial Kernelization. Search on Bibsonomy CiE The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, George B. Mertzios, André Nichterlein Kernelization Lower Bounds for Finding Constant-Size Subgraphs. Search on Bibsonomy CiE The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler The Minimum Shared Edges Problem on Grid-like Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The Complexity of Routing with Few Collisions. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Till Fluschnik, George B. Mertzios, André Nichterlein Kernelization Lower Bounds for Finding Constant Size Subgraphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz Exact Mean Computation in Dynamic Time Warping Spaces. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When can Graph Hyperbolicity be computed in Linear Time? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier Parameterized Aspects of Triangle Enumeration. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier The Computational Complexity of Finding Separators in Temporal Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker Fair Knapsack. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler The Minimum Shared Edges Problem on Grid-Like Graphs. Search on Bibsonomy WG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The Complexity of Routing with Few Collisions. Search on Bibsonomy FCT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier Parameterized Aspects of Triangle Enumeration. Search on Bibsonomy FCT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When Can Graph Hyperbolicity Be Computed in Linear Time? Search on Bibsonomy WADS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Steffen Kriewald, Anselmo García Cantú Ros, Bin Zhou, Dominik Reusser, Jürgen P. Kropp, Diego Rybski The Size Distribution, Scaling Properties and Spatial Organization of Urban Clusters: A Global and Regional Percolation Perspective. Search on Bibsonomy ISPRS Int. J. Geo-Information The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier Diminishable Parameterized Problems and Strict Polynomial Kernelization. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Till Fluschnik, Manuel Sorge The Minimum Shared Edges Problem on Planar Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý Finding Secluded Places of Special Interest in Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý Finding Secluded Places of Special Interest in Graphs. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem. Search on Bibsonomy FSTTCS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #45 of 45 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license