Till Fluschnik

86 papers A* 6A 3B 10C 5Journal 57Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Maximizing Index Diversity in Committee Elections. CoRR Paula Böhm, Robert Bredereck, Till Fluschnik
2026	J	`jnl`	Placing Green Bridges Optimally for Robust Habitat Reconnection. CoRR Gero Ellmies, Till Fluschnik
2026	J	`jnl`	Smooth Routing in Decaying Trees. CoRR Till Fluschnik, Amela Pucic, Malte Renken
2025	J	`jnl`	Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs. CoRR Christian Wallisch, Till Fluschnik, Leon Kellerhals
2025	A	`conf`	Properties of Egalitarian Sequences of Committees: Theory and Experiments. ECAI Paula Böhm, Robert Bredereck, Till Fluschnik
2025	J	`jnl`	Properties of Egalitarian Sequences of Committees: Theory and Experiments. CoRR Paula Böhm, Robert Bredereck, Till Fluschnik
2024	A*	`conf`	Locally Rainbow Paths. AAAI Till Fluschnik, Leon Kellerhals, Malte Renken
2024	J	`jnl`	Locally Rainbow Paths. CoRR Till Fluschnik, Leon Kellerhals, Malte Renken
2024	J	`jnl`	Placing Green Bridges Optimally, with a Multivariate Analysis. Theory Comput. Syst. Till Fluschnik, Leon Kellerhals
2023	A*	`conf`	Algorithmics of Egalitarian versus Equitable Sequences of Committees. IJCAI Eva Michelle Deltl, Till Fluschnik, Robert Bredereck
2023	J	`jnl`	Algorithmics of Egalitarian versus Equitable Sequences of Committees. CoRR Eva Michelle Deltl, Till Fluschnik, Robert Bredereck
2023	A	`conf`	Efficiently Computing Smallest Agreeable Sets. ECAI Robert Bredereck, Till Fluschnik, Nimrod Talmon
2023	J	`jnl`	Multistage s-t Path: Confronting Similarity with Dissimilarity. Algorithmica Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2023	J	`jnl`	Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2022	—	`conf`	Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. SAND Till Fluschnik, Pascal Kunz
2022	—	`conf`	Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Multistage Vertex Cover. Theory Comput. Syst. Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
2022	A*	`conf`	Placing Green Bridges Optimally, with Habitats Inducing Cycles. IJCAI Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals
2022	J	`jnl`	Placing Green Bridges Optimally, with Habitats Inducing Cycles. CoRR Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals
2022	A*	`conf`	When Votes Change and Committees Should (Not). IJCAI Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
2021	J	`jnl`	3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs. CoRR Dario Cavallaro, Till Fluschnik
2021	C	`conf`	A Multistage View on 2-Satisfiability. CIAC Till Fluschnik
2021	J	`jnl`	Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. CoRR Till Fluschnik, Pascal Kunz
2021	B	`conf`	Feedback Vertex Set on Hamiltonian Graphs. WG Dario Cavallaro, Till Fluschnik
2021	J	`jnl`	Feedback Vertex Set on Hamiltonian Graphs. CoRR Dario Cavallaro, Till Fluschnik
2021	J	`jnl`	Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken
2021	C	`conf`	Placing Green Bridges Optimally, with a Multivariate Analysis. CiE Till Fluschnik, Leon Kellerhals
2021	J	`jnl`	Placing Green Bridges Optimally, with a Multivariate Analysis. CoRR Till Fluschnik, Leon Kellerhals
2021	J	`jnl`	Polynomial Turing Kernels for Clique with an Optimal Number of Queries. CoRR Till Fluschnik, Klaus Heeger, Danny Hermelin
2020	J	`jnl`	A Multistage View on 2-Satisfiability. CoRR Till Fluschnik
2020	—	`conf`	As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	Diminishable parameterized problems and strict polynomial kernelization. Comput. Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Multistage Committee Election. CoRR Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk
2020	B	`conf`	Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs. ISAAC Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2020	J	`jnl`	Multistage s-t Path: Confronting Similarity with Dissimilarity. CoRR Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche
2020	J	`jnl`	On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2020	J	`jnl`	On the computational complexity of length- and neighborhood-constrained path problems. Inf. Process. Lett. Max-Jonathan Luckow, Till Fluschnik
2020	J	`jnl`	Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2020	J	`jnl`	Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2019	J	`jnl`	A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
2019	J	`jnl`	Exact mean computation in dynamic time warping spaces. Data Min. Knowl. Discov. Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
2019	A*	`conf`	Fair Knapsack. AAAI Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker
2019	B	`conf`	Multistage Vertex Cover. IPEC Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
2019	J	`jnl`	Multistage Vertex Cover. CoRR Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
2019	—	`conf`	On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2019	J	`jnl`	Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	The complexity of routing with collision avoidance. J. Comput. Syst. Sci. Till Fluschnik, Marco Morik, Manuel Sorge
2019	J	`jnl`	The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2019	J	`jnl`	When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2018	J	`jnl`	A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
2018	C	`conf`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2018	A	`conf`	Exact Mean Computation in Dynamic Time Warping Spaces. SDM Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
2018	J	`jnl`	Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2018	C	`conf`	Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE Till Fluschnik, George B. Mertzios, André Nichterlein
2018	J	`jnl`	On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018	J	`jnl`	On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems. CoRR Max-Jonathan Luckow, Till Fluschnik
2018	C	`conf`	Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018	J	`jnl`	Parameterized algorithms and data reduction for safe convoy routing. CoRR René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018	B	`conf`	Temporal Graph Classes: A View Through Temporal Separators. WG Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2018	J	`jnl`	Temporal Graph Classes: A View Through Temporal Separators. CoRR Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2018	B	`conf`	The Complexity of Finding Small Separators in Temporal Graphs. MFCS Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2018	J	`jnl`	The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017	J	`jnl`	Exact Mean Computation in Dynamic Time Warping Spaces. CoRR Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh J. Jain, Rolf Niedermeier, David Schultz
2017	J	`jnl`	Fair Knapsack. CoRR Till Fluschnik, Piotr Skowron, Mervin Triphaus, Kai Wilker
2017	J	`jnl`	Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR Till Fluschnik, George B. Mertzios, André Nichterlein
2017	B	`conf`	Parameterized Aspects of Triangle Enumeration. FCT Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized Aspects of Triangle Enumeration. CoRR Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	The Complexity of Routing with Few Collisions. FCT Till Fluschnik, Marco Morik, Manuel Sorge
2017	J	`jnl`	The Complexity of Routing with Few Collisions. CoRR Till Fluschnik, Marco Morik, Manuel Sorge
2017	J	`jnl`	The Computational Complexity of Finding Separators in Temporal Graphs. CoRR Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2017	B	`conf`	The Minimum Shared Edges Problem on Grid-Like Graphs. WG Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
2017	J	`jnl`	The Minimum Shared Edges Problem on Grid-like Graphs. CoRR Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
2017	B	`conf`	When Can Graph Hyperbolicity Be Computed in Linear Time? WADS Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2017	J	`jnl`	When can Graph Hyperbolicity be computed in Linear Time? CoRR Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2016	J	`jnl`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2016	B	`conf`	Finding Secluded Places of Special Interest in Graphs. IPEC René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016	J	`jnl`	Finding Secluded Places of Special Interest in Graphs. CoRR René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016	A*	`conf`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	The Minimum Shared Edges Problem on Planar Graphs. CoRR Till Fluschnik, Manuel Sorge
2016	J	`jnl`	The Parameterized Complexity of the Minimum Shared Edges Problem. CoRR Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge
2016	J	`jnl`	The Size Distribution, Scaling Properties and Spatial Organization of Urban Clusters: A Global and Regional Percolation Perspective. ISPRS Int. J. Geo Inf. Till Fluschnik, Steffen Kriewald, Anselmo García Cantú Ros, Bin Zhou, Dominik Reusser, Jürgen P. Kropp, Diego Rybski
2015	J	`jnl`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2015	—	`conf`	The Parameterized Complexity of the Minimum Shared Edges Problem. FSTTCS Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge