Algorithmik und Komplexitätstheorie
Institut für Softwaretechnik und Theoretische Informatik
Fakultät Elektrotechnik und Informatik
Technische Universität Berlin
Sekr. TEL 5-1
Ernst Reuter Platz 7
D-10587 Berlin
Email: till.fluschnik 'at' tu-berlin 'dot' de
PhD student
© Till Fluschnik

Publications.

2017.

Authors Title Journal Conference arxiv
TF, Marco Morik, and Manuel Sorge The Complexity of Routing with Few Collisions FCT 2017: 10472:257–270 arXiv
Matthias Bentert, TF, André Nichterlein, and Rolf Niedermeier Parameterized Aspects of Triangle Enumeration FCT 2017: 10472:96–110, (Best Student Paper Award) arXiv
TF, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, and Nimrod Talmon When can Graph Hyperbolicity be computed in Linear Time? WADS 2017: 10389:397–408 arXiv
TF, Meike Hatzel, Steffen Härtlein, Hendrik Molter, and Henning Seidler The Minimum Shared Edges Problem on Grid-like Graphs to appear, WG 2017 arXiv
Henning Fernau, TF, Danny Hermelin, Andreas Krebs, Hendrik Molter, and Rolf Niedermeier Diminishable Parameterized Problems and Strict Polynomial Kernelization arXiv

2016.

Authors Title Journal Conference arxiv
René van Bevern, TF, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondřej Suchý The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs under review IPEC 2016: 5:1-5:16 arXiv (2017)
TF, Steffen Kriewald, Anselmo García Cantú Ros, Bin Zhou, Dominik E. Reusser, Jürgen P. Kropp, and Diego Rybski The Size Distribution, Scaling Properties and Spatial Organization of Urban Clusters: A Global and Regional Perspective IJGI, ISPRS Int. J. Geo-Inf. 2016, 5(7), 110
------
arxiv (2014)
TF, Danny Hermelin, André Nichterlein, and Rolf Niedermeier Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems under review ICALP 2016: (55)25:1-25:14 arxiv (2015)
TF and Manuel Sorge The Minimum Shared Edges Problem on Planar Graphs
------
------
arXiv
Ramana Venkata Gudipudi, TF, Anselmo García Cantú Ros, Carsten Walther, and Jürgen P. Kropp City Density and CO2 Efficiency Energy Policy, (91)352–361
------
------

2015.

Authors Title Journal Conference arxiv
TF, Stefan Kratsch, Rolf Niedermeier, and Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem under review FSTTCS 2015: 448-462 arxiv (2016)

2014.

Authors Title Journal Conference arxiv
Anselmo García Cantú Ros, TF, and Jürgen P. Kropp Variance-based control of regime shifts: bistability and oscillations under review
------
arXiv

Theses.

Master Thesis.

TF. The Parameterized Complexity of Finding Paths with Shared Edges. TU Berlin.

Bachelor Thesis.

TF. Kritisches Verhalten eines verdünnten zufälligen Polymers. TU Berlin.


Participant.

2017.

43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17). In Eindhoven, The Netherlands, June 21-23, 2017.

2015.

Workshop on Kernelization (WORKER) 2015. In Nordfjordeid, Norway. June 2015.
© Till Fluschnik


Talks.

2017.

72. Algorithms and Data Structures Symposium (WADS) . St. John's, Newfundland, Canada, July 31-August 2
© Till Fluschnik

2016.

72. Workshop über Algorithmen und Komplexität . Leibniz Universität Hannover, Institut für Theoretische Informatik.
© Till Fluschnik
11th International Symposium on Parameterized and Exact Computation (IPEC 2016) . In Aarhus, Denmark, August 24-26.
© Till Fluschnik
43rd International Colloquium on Automata, Languages and Programming (ICALP 2016). In Rome, Italy. July 2016.
© Till Fluschnik

2015.

35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). In Bangalore, India. December 2015.
© Till Fluschnik
7th Workshop on Graph Classes, Optimization, and Width Parameters (GROW). In Aussois, France. October 2015. Slides.
© Till Fluschnik
The size distribution, scaling properties and spatial organization of urban clusters: a global and regional perspective. Verhandlungen der Deutschen Physikalischen Gesellschaft, AKE 14: Physics of Sustainability and Human-Nature Interactions I, at TU Berlin, Germany. March 2015.

Co-Supervised Theses.

2017.

2016.

Matthias Bentert. Parametrised Algorithms for Finding Triangles in Graphs - Detection, Counting and Enumeration. TU Berlin, December 2016, Master thesis.

Maximilian Stahlberg. Finding the Most Vital Edges for Shortest Paths - Algorithms and Complexity for Special Graph Classes. TU Berlin, February, 2016. Bachelor thesis.

Marco Morik. The Complexity of Routing with Collision Avoidance. TU Berlin, June, 2016. Bachelor thesis.


Misc.

Script Recommendations (for Lectures etc.).

Analysis (and more) Scripts by Dirk Ferus (only in German).

Scripts by Wolfgang König (in the context of probabilistic theory, only in German): in particular, Wahrscheinlichkeitstheorie I+II and Stochastische Algorithmen.

Script by Stefan Felsner (together with students) about Graph theory (only in German)

Book Recommendations.

Martin Aigner and Günter M. Ziegler: Proof from THE BOOK

Links.

TÜV Rheinland Berlin Marathon-Relay

Orthodromic Spatial Clustering