Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Till Fluschnik
@inproceedings{DBLP:conf/aaai/FluschnikKR24,
author = {Till Fluschnik and
Leon Kellerhals and
Malte Renken},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Locally Rainbow Paths},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {8013--8021},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i8.28639},
doi = {10.1609/AAAI.V38I8.28639},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FluschnikKR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-12905,
author = {Till Fluschnik and
Leon Kellerhals and
Malte Renken},
title = {Locally Rainbow Paths},
journal = {CoRR},
volume = {abs/2402.12905},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.12905},
doi = {10.48550/ARXIV.2402.12905},
eprinttype = {arXiv},
eprint = {2402.12905},
timestamp = {Thu, 21 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-12905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FluschnikNSZ23,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {2028--2064},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01077-w},
doi = {10.1007/S00453-022-01077-W},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FluschnikNSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BentertBFNN23,
author = {Matthias Bentert and
Ren{\'{e}} van Bevern and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Polynomial-time data reduction for weighted problems beyond additive
goal functions},
journal = {Discret. Appl. Math.},
volume = {328},
pages = {117--133},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2022.11.018},
doi = {10.1016/J.DAM.2022.11.018},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BentertBFNN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BredereckFT23,
author = {Robert Bredereck and
Till Fluschnik and
Nimrod Talmon},
editor = {Kobi Gal and
Ann Now{\'{e}} and
Grzegorz J. Nalepa and
Roy Fairstein and
Roxana Radulescu},
title = {Efficiently Computing Smallest Agreeable Sets},
booktitle = {{ECAI} 2023 - 26th European Conference on Artificial Intelligence,
September 30 - October 4, 2023, Krak{\'{o}}w, Poland - Including
12th Conference on Prestigious Applications of Intelligent Systems
{(PAIS} 2023)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {372},
pages = {311--318},
publisher = {{IOS} Press},
year = {2023},
url = {https://doi.org/10.3233/FAIA230285},
doi = {10.3233/FAIA230285},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/BredereckFT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/DeltlFB23,
author = {Eva Michelle Deltl and
Till Fluschnik and
Robert Bredereck},
title = {Algorithmics of Egalitarian versus Equitable Sequences of Committees},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {2651--2658},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/295},
doi = {10.24963/IJCAI.2023/295},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/DeltlFB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-14850,
author = {Eva Michelle Deltl and
Till Fluschnik and
Robert Bredereck},
title = {Algorithmics of Egalitarian versus Equitable Sequences of Committees},
journal = {CoRR},
volume = {abs/2306.14850},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.14850},
doi = {10.48550/ARXIV.2306.14850},
eprinttype = {arXiv},
eprint = {2306.14850},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-14850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FluschnikNRZ22,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
title = {Multistage Vertex Cover},
journal = {Theory Comput. Syst.},
volume = {66},
number = {2},
pages = {454--483},
year = {2022},
url = {https://doi.org/10.1007/s00224-022-10069-w},
doi = {10.1007/S00224-022-10069-W},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FluschnikNRZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BredereckF022,
author = {Robert Bredereck and
Till Fluschnik and
Andrzej Kaczmarczyk},
editor = {Luc De Raedt},
title = {When Votes Change and Committees Should (Not)},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {144--150},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/21},
doi = {10.24963/IJCAI.2022/21},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/BredereckF022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/HerkenrathFGK22,
author = {Maike Herkenrath and
Till Fluschnik and
Francesco Grothe and
Leon Kellerhals},
editor = {Luc De Raedt},
title = {Placing Green Bridges Optimally, with Habitats Inducing Cycles},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {3825--3831},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/531},
doi = {10.24963/IJCAI.2022/531},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/HerkenrathFGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/FluschnikK22,
author = {Till Fluschnik and
Pascal Kunz},
editor = {James Aspnes and
Othon Michail},
title = {Bipartite Temporal Graphs and the Parameterized Complexity of Multistage
2-Coloring},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {16:1--16:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.16},
doi = {10.4230/LIPICS.SAND.2022.16},
timestamp = {Fri, 29 Apr 2022 14:01:39 +0200},
biburl = {https://dblp.org/rec/conf/sand/FluschnikK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KunzFNR22,
author = {Pascal Kunz and
Till Fluschnik and
Rolf Niedermeier and
Malte Renken},
editor = {Artur Czumaj and
Qin Xin},
title = {Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs
and Their Relatives},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {29:1--29:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.29},
doi = {10.4230/LIPICS.SWAT.2022.29},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KunzFNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-12273,
author = {Maike Herkenrath and
Till Fluschnik and
Francesco Grothe and
Leon Kellerhals},
title = {Placing Green Bridges Optimally, with Habitats Inducing Cycles},
journal = {CoRR},
volume = {abs/2201.12273},
year = {2022},
url = {https://arxiv.org/abs/2201.12273},
eprinttype = {arXiv},
eprint = {2201.12273},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-12273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Fluschnik21,
author = {Till Fluschnik},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {A Multistage View on 2-Satisfiability},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {231--244},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_16},
doi = {10.1007/978-3-030-75242-2\_16},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Fluschnik21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/FluschnikK21,
author = {Till Fluschnik and
Leon Kellerhals},
editor = {Liesbeth De Mol and
Andreas Weiermann and
Florin Manea and
David Fern{\'{a}}ndez{-}Duque},
title = {Placing Green Bridges Optimally, with a Multivariate Analysis},
booktitle = {Connecting with Computability - 17th Conference on Computability in
Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12813},
pages = {204--216},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80049-9\_19},
doi = {10.1007/978-3-030-80049-9\_19},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/FluschnikK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CavallaroF21,
author = {Dario Cavallaro and
Till Fluschnik},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Feedback Vertex Set on Hamiltonian Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {207--218},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_16},
doi = {10.1007/978-3-030-86838-3\_16},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/CavallaroF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-04539,
author = {Till Fluschnik and
Leon Kellerhals},
title = {Placing Green Bridges Optimally, with a Multivariate Analysis},
journal = {CoRR},
volume = {abs/2102.04539},
year = {2021},
url = {https://arxiv.org/abs/2102.04539},
eprinttype = {arXiv},
eprint = {2102.04539},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-04539.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-05322,
author = {Dario Cavallaro and
Till Fluschnik},
title = {Feedback Vertex Set on Hamiltonian Graphs},
journal = {CoRR},
volume = {abs/2104.05322},
year = {2021},
url = {https://arxiv.org/abs/2104.05322},
eprinttype = {arXiv},
eprint = {2104.05322},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-05322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-08470,
author = {Dario Cavallaro and
Till Fluschnik},
title = {3-Coloring on Regular, Planar, and Ordered Hamiltonian Graphs},
journal = {CoRR},
volume = {abs/2104.08470},
year = {2021},
url = {https://arxiv.org/abs/2104.08470},
eprinttype = {arXiv},
eprint = {2104.08470},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-08470.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04321,
author = {Pascal Kunz and
Till Fluschnik and
Rolf Niedermeier and
Malte Renken},
title = {Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs
and their Relatives},
journal = {CoRR},
volume = {abs/2107.04321},
year = {2021},
url = {https://arxiv.org/abs/2107.04321},
eprinttype = {arXiv},
eprint = {2107.04321},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04321.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-03279,
author = {Till Fluschnik and
Klaus Heeger and
Danny Hermelin},
title = {Polynomial Turing Kernels for Clique with an Optimal Number of Queries},
journal = {CoRR},
volume = {abs/2110.03279},
year = {2021},
url = {https://arxiv.org/abs/2110.03279},
eprinttype = {arXiv},
eprint = {2110.03279},
timestamp = {Thu, 21 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-03279.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-09049,
author = {Till Fluschnik and
Pascal Kunz},
title = {Bipartite Temporal Graphs and the Parameterized Complexity of Multistage
2-Coloring},
journal = {CoRR},
volume = {abs/2111.09049},
year = {2021},
url = {https://arxiv.org/abs/2111.09049},
eprinttype = {arXiv},
eprint = {2111.09049},
timestamp = {Mon, 22 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-09049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/FernauFHKMN20,
author = {Henning Fernau and
Till Fluschnik and
Danny Hermelin and
Andreas Krebs and
Hendrik Molter and
Rolf Niedermeier},
title = {Diminishable parameterized problems and strict polynomial kernelization},
journal = {Comput.},
volume = {9},
number = {1},
pages = {1--24},
year = {2020},
url = {https://doi.org/10.3233/COM-180220},
doi = {10.3233/COM-180220},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/computability/FernauFHKMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuckowF20,
author = {Max{-}Jonathan Luckow and
Till Fluschnik},
title = {On the computational complexity of length- and neighborhood-constrained
path problems},
journal = {Inf. Process. Lett.},
volume = {156},
pages = {105913},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2019.105913},
doi = {10.1016/J.IPL.2019.105913},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LuckowF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ZschocheFMN20,
author = {Philipp Zschoche and
Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier},
title = {The complexity of finding small separators in temporal graphs},
journal = {J. Comput. Syst. Sci.},
volume = {107},
pages = {72--92},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2019.07.006},
doi = {10.1016/J.JCSS.2019.07.006},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ZschocheFMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BevernFT20,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {Parameterized algorithms and data reduction for the short secluded
s-t-path problem},
journal = {Networks},
volume = {75},
number = {1},
pages = {34--63},
year = {2020},
url = {https://doi.org/10.1002/net.21904},
doi = {10.1002/NET.21904},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BevernFT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BevernFT20a,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {On approximate data reduction for the Rural Postman Problem: Theory
and experiments},
journal = {Networks},
volume = {76},
number = {4},
pages = {485--508},
year = {2020},
url = {https://doi.org/10.1002/net.21985},
doi = {10.1002/NET.21985},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BevernFT20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FluschnikMNRZ20,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken and
Philipp Zschoche},
title = {Temporal graph classes: {A} view through temporal separators},
journal = {Theor. Comput. Sci.},
volume = {806},
pages = {197--218},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.03.031},
doi = {10.1016/J.TCS.2019.03.031},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/FluschnikMNRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/FluschnikMNRZ20,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken and
Philipp Zschoche},
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {As Time Goes By: Reflections on Treewidth for Temporal Graphs},
booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12160},
pages = {49--77},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0\_6},
doi = {10.1007/978-3-030-42071-0\_6},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/FluschnikMNRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FluschnikNSZ20,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity in
Temporal Graphs},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {43:1--43:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.43},
doi = {10.4230/LIPICS.ISAAC.2020.43},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FluschnikNSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07569,
author = {Till Fluschnik and
Rolf Niedermeier and
Carsten Schubert and
Philipp Zschoche},
title = {Multistage s-t Path: Confronting Similarity with Dissimilarity},
journal = {CoRR},
volume = {abs/2002.07569},
year = {2020},
url = {https://arxiv.org/abs/2002.07569},
eprinttype = {arXiv},
eprint = {2002.07569},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07569.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-13491,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken and
Philipp Zschoche},
title = {As Time Goes By: Reflections on Treewidth for Temporal Graphs},
journal = {CoRR},
volume = {abs/2004.13491},
year = {2020},
url = {https://arxiv.org/abs/2004.13491},
eprinttype = {arXiv},
eprint = {2004.13491},
timestamp = {Sat, 02 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-13491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-02300,
author = {Robert Bredereck and
Till Fluschnik and
Andrzej Kaczmarczyk},
title = {Multistage Committee Election},
journal = {CoRR},
volume = {abs/2005.02300},
year = {2020},
url = {https://arxiv.org/abs/2005.02300},
eprinttype = {arXiv},
eprint = {2005.02300},
timestamp = {Sat, 09 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-02300.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-02325,
author = {Till Fluschnik},
title = {A Multistage View on 2-Satisfiability},
journal = {CoRR},
volume = {abs/2011.02325},
year = {2020},
url = {https://arxiv.org/abs/2011.02325},
eprinttype = {arXiv},
eprint = {2011.02325},
timestamp = {Mon, 09 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-02325.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FluschnikKMNNT19,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
title = {When Can Graph Hyperbolicity be Computed in Linear Time?},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {2016--2045},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0522-6},
doi = {10.1007/S00453-018-0522-6},
timestamp = {Wed, 17 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FluschnikKMNNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/datamine/BrillFFJNS19,
author = {Markus Brill and
Till Fluschnik and
Vincent Froese and
Brijnesh J. Jain and
Rolf Niedermeier and
David Schultz},
title = {Exact mean computation in dynamic time warping spaces},
journal = {Data Min. Knowl. Discov.},
volume = {33},
number = {1},
pages = {252--291},
year = {2019},
url = {https://doi.org/10.1007/s10618-018-0604-8},
doi = {10.1007/S10618-018-0604-8},
timestamp = {Tue, 22 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/datamine/BrillFFJNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FluschnikMS19,
author = {Till Fluschnik and
Marco Morik and
Manuel Sorge},
title = {The complexity of routing with collision avoidance},
journal = {J. Comput. Syst. Sci.},
volume = {102},
pages = {69--86},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.01.001},
doi = {10.1016/J.JCSS.2019.01.001},
timestamp = {Fri, 08 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FluschnikMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BentertFNN19,
author = {Matthias Bentert and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Parameterized aspects of triangle enumeration},
journal = {J. Comput. Syst. Sci.},
volume = {103},
pages = {61--77},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.02.004},
doi = {10.1016/J.JCSS.2019.02.004},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BentertFNN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FluschnikKNS19,
author = {Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge},
title = {The parameterized complexity of the minimum shared edges problem},
journal = {J. Comput. Syst. Sci.},
volume = {106},
pages = {23--48},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2018.12.002},
doi = {10.1016/J.JCSS.2018.12.002},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/FluschnikKNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BazganFNNS19,
author = {Cristina Bazgan and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Maximilian Stahlberg},
title = {A more fine-grained complexity analysis of finding the most vital
edges for undirected shortest paths},
journal = {Networks},
volume = {73},
number = {1},
pages = {23--37},
year = {2019},
url = {https://doi.org/10.1002/net.21832},
doi = {10.1002/NET.21832},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BazganFNNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/FluschnikSTW19,
author = {Till Fluschnik and
Piotr Skowron and
Mervin Triphaus and
Kai Wilker},
title = {Fair Knapsack},
booktitle = {The Thirty-Third {AAAI} Conference on Artificial Intelligence, {AAAI}
2019, The Thirty-First Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2019, The Ninth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2019, Honolulu, Hawaii,
USA, January 27 - February 1, 2019},
pages = {1941--1948},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33011941},
doi = {10.1609/AAAI.V33I01.33011941},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/FluschnikSTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FluschnikNRZ19,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Multistage Vertex Cover},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.14},
doi = {10.4230/LIPICS.IPEC.2019.14},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/FluschnikNRZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/motor/BevernFT19,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
editor = {Michael Yu. Khachay and
Yury Kochetov and
Panos M. Pardalos},
title = {On (1+{\textbackslash}varepsilon {)} -approximate Data Reduction for
the Rural Postman Problem},
booktitle = {Mathematical Optimization Theory and Operations Research - 18th International
Conference, {MOTOR} 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11548},
pages = {279--294},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22629-9\_20},
doi = {10.1007/978-3-030-22629-9\_20},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/motor/BevernFT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-00659,
author = {Till Fluschnik and
Rolf Niedermeier and
Valentin Rohm and
Philipp Zschoche},
title = {Multistage Vertex Cover},
journal = {CoRR},
volume = {abs/1906.00659},
year = {2019},
url = {http://arxiv.org/abs/1906.00659},
eprinttype = {arXiv},
eprint = {1906.00659},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-00659.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00277,
author = {Matthias Bentert and
Ren{\'{e}} van Bevern and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Polynomial-Time Preprocessing for Weighted Problems Beyond Additive
Goal Functions},
journal = {CoRR},
volume = {abs/1910.00277},
year = {2019},
url = {http://arxiv.org/abs/1910.00277},
eprinttype = {arXiv},
eprint = {1910.00277},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00277.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BevernFMMSS18,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
George B. Mertzios and
Hendrik Molter and
Manuel Sorge and
Ondrej Such{\'{y}}},
title = {The parameterized complexity of finding secluded solutions to some
classical optimization problems on graphs},
journal = {Discret. Optim.},
volume = {30},
pages = {20--50},
year = {2018},
url = {https://doi.org/10.1016/j.disopt.2018.05.002},
doi = {10.1016/J.DISOPT.2018.05.002},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/BevernFMMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FluschnikHNN18,
author = {Till Fluschnik and
Danny Hermelin and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Fractals for Kernelization Lower Bounds},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {1},
pages = {656--681},
year = {2018},
url = {https://doi.org/10.1137/16M1088740},
doi = {10.1137/16M1088740},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FluschnikHNN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/BevernFT18,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
editor = {Ralf Bornd{\"{o}}rfer and
Sabine Storandt},
title = {Parameterized Algorithms and Data Reduction for Safe Convoy Routing},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2018, August 23-24, 2018, Helsinki,
Finland},
series = {OASIcs},
volume = {65},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2018.10},
doi = {10.4230/OASICS.ATMOS.2018.10},
timestamp = {Tue, 15 Feb 2022 09:40:04 +0100},
biburl = {https://dblp.org/rec/conf/atmos/BevernFT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/FernauFHKMN18,
author = {Henning Fernau and
Till Fluschnik and
Danny Hermelin and
Andreas Krebs and
Hendrik Molter and
Rolf Niedermeier},
editor = {Florin Manea and
Russell G. Miller and
Dirk Nowotka},
title = {Diminishable Parameterized Problems and Strict Polynomial Kernelization},
booktitle = {Sailing Routes in the World of Computation - 14th Conference on Computability
in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10936},
pages = {161--171},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94418-0\_17},
doi = {10.1007/978-3-319-94418-0\_17},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cie/FernauFHKMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/FluschnikMN18,
author = {Till Fluschnik and
George B. Mertzios and
Andr{\'{e}} Nichterlein},
editor = {Florin Manea and
Russell G. Miller and
Dirk Nowotka},
title = {Kernelization Lower Bounds for Finding Constant-Size Subgraphs},
booktitle = {Sailing Routes in the World of Computation - 14th Conference on Computability
in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10936},
pages = {183--193},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94418-0\_19},
doi = {10.1007/978-3-319-94418-0\_19},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/FluschnikMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ZschocheFMN18,
author = {Philipp Zschoche and
Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {The Complexity of Finding Small Separators in Temporal Graphs},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {45:1--45:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.45},
doi = {10.4230/LIPICS.MFCS.2018.45},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ZschocheFMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/BrillFFJNS18,
author = {Markus Brill and
Till Fluschnik and
Vincent Froese and
Brijnesh J. Jain and
Rolf Niedermeier and
David Schultz},
editor = {Martin Ester and
Dino Pedreschi},
title = {Exact Mean Computation in Dynamic Time Warping Spaces},
booktitle = {Proceedings of the 2018 {SIAM} International Conference on Data Mining,
{SDM} 2018, May 3-5, 2018, San Diego Marriott Mission Valley, San
Diego, CA, {USA}},
pages = {540--548},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975321.61},
doi = {10.1137/1.9781611975321.61},
timestamp = {Sun, 13 May 2018 11:47:13 +0200},
biburl = {https://dblp.org/rec/conf/sdm/BrillFFJNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FluschnikMNZ18,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Temporal Graph Classes: {A} View Through Temporal Separators},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {216--227},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_18},
doi = {10.1007/978-3-030-00256-5\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FluschnikMNZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-00882,
author = {Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
title = {Temporal Graph Classes: {A} View Through Temporal Separators},
journal = {CoRR},
volume = {abs/1803.00882},
year = {2018},
url = {http://arxiv.org/abs/1803.00882},
eprinttype = {arXiv},
eprint = {1803.00882},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-00882.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-09155,
author = {Cristina Bazgan and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Maximilian Stahlberg},
title = {A More Fine-Grained Complexity Analysis of Finding the Most Vital
Edges for Undirected Shortest Paths},
journal = {CoRR},
volume = {abs/1804.09155},
year = {2018},
url = {http://arxiv.org/abs/1804.09155},
eprinttype = {arXiv},
eprint = {1804.09155},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-09155.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09540,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {Parameterized algorithms and data reduction for safe convoy routing},
journal = {CoRR},
volume = {abs/1806.09540},
year = {2018},
url = {http://arxiv.org/abs/1806.09540},
eprinttype = {arXiv},
eprint = {1806.09540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-09540.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-02359,
author = {Max{-}Jonathan Luckow and
Till Fluschnik},
title = {On the Computational Complexity of Length- and Neighborhood-Constrained
Path Problems},
journal = {CoRR},
volume = {abs/1808.02359},
year = {2018},
url = {http://arxiv.org/abs/1808.02359},
eprinttype = {arXiv},
eprint = {1808.02359},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-02359.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-10131,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
Oxana Yu. Tsidulko},
title = {On (1+{\(\epsilon\)})-approximate problem kernels for the Rural Postman
Problem},
journal = {CoRR},
volume = {abs/1812.10131},
year = {2018},
url = {http://arxiv.org/abs/1812.10131},
eprinttype = {arXiv},
eprint = {1812.10131},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-10131.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BentertFNN17,
author = {Matthias Bentert and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Ralf Klasing and
Marc Zeitoun},
title = {Parameterized Aspects of Triangle Enumeration},
booktitle = {Fundamentals of Computation Theory - 21st International Symposium,
{FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10472},
pages = {96--110},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55751-8\_9},
doi = {10.1007/978-3-662-55751-8\_9},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BentertFNN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FluschnikMS17,
author = {Till Fluschnik and
Marco Morik and
Manuel Sorge},
editor = {Ralf Klasing and
Marc Zeitoun},
title = {The Complexity of Routing with Few Collisions},
booktitle = {Fundamentals of Computation Theory - 21st International Symposium,
{FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10472},
pages = {257--270},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55751-8\_21},
doi = {10.1007/978-3-662-55751-8\_21},
timestamp = {Tue, 29 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/FluschnikMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FluschnikKMNNT17,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {When Can Graph Hyperbolicity Be Computed in Linear Time?},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {397--408},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_34},
doi = {10.1007/978-3-319-62127-2\_34},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/FluschnikKMNNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FluschnikHHMS17,
author = {Till Fluschnik and
Meike Hatzel and
Steffen H{\"{a}}rtlein and
Hendrik Molter and
Henning Seidler},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {The Minimum Shared Edges Problem on Grid-Like Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {249--262},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_19},
doi = {10.1007/978-3-319-68705-6\_19},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FluschnikHHMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikKMNNT17,
author = {Till Fluschnik and
Christian Komusiewicz and
George B. Mertzios and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Nimrod Talmon},
title = {When can Graph Hyperbolicity be computed in Linear Time?},
journal = {CoRR},
volume = {abs/1702.06503},
year = {2017},
url = {http://arxiv.org/abs/1702.06503},
eprinttype = {arXiv},
eprint = {1702.06503},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikKMNNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BentertFNN17,
author = {Matthias Bentert and
Till Fluschnik and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Parameterized Aspects of Triangle Enumeration},
journal = {CoRR},
volume = {abs/1702.06548},
year = {2017},
url = {http://arxiv.org/abs/1702.06548},
eprinttype = {arXiv},
eprint = {1702.06548},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BentertFNN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikHHMS17,
author = {Till Fluschnik and
Meike Hatzel and
Steffen H{\"{a}}rtlein and
Hendrik Molter and
Henning Seidler},
title = {The Minimum Shared Edges Problem on Grid-like Graphs},
journal = {CoRR},
volume = {abs/1703.02332},
year = {2017},
url = {http://arxiv.org/abs/1703.02332},
eprinttype = {arXiv},
eprint = {1703.02332},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikHHMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikMS17,
author = {Till Fluschnik and
Marco Morik and
Manuel Sorge},
title = {The Complexity of Routing with Few Collisions},
journal = {CoRR},
volume = {abs/1705.03673},
year = {2017},
url = {http://arxiv.org/abs/1705.03673},
eprinttype = {arXiv},
eprint = {1705.03673},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-07601,
author = {Till Fluschnik and
George B. Mertzios and
Andr{\'{e}} Nichterlein},
title = {Kernelization Lower Bounds for Finding Constant Size Subgraphs},
journal = {CoRR},
volume = {abs/1710.07601},
year = {2017},
url = {http://arxiv.org/abs/1710.07601},
eprinttype = {arXiv},
eprint = {1710.07601},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-07601.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-08937,
author = {Markus Brill and
Till Fluschnik and
Vincent Froese and
Brijnesh J. Jain and
Rolf Niedermeier and
David Schultz},
title = {Exact Mean Computation in Dynamic Time Warping Spaces},
journal = {CoRR},
volume = {abs/1710.08937},
year = {2017},
url = {http://arxiv.org/abs/1710.08937},
eprinttype = {arXiv},
eprint = {1710.08937},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-08937.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00963,
author = {Philipp Zschoche and
Till Fluschnik and
Hendrik Molter and
Rolf Niedermeier},
title = {The Computational Complexity of Finding Separators in Temporal Graphs},
journal = {CoRR},
volume = {abs/1711.00963},
year = {2017},
url = {http://arxiv.org/abs/1711.00963},
eprinttype = {arXiv},
eprint = {1711.00963},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00963.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04520,
author = {Till Fluschnik and
Piotr Skowron and
Mervin Triphaus and
Kai Wilker},
title = {Fair Knapsack},
journal = {CoRR},
volume = {abs/1711.04520},
year = {2017},
url = {http://arxiv.org/abs/1711.04520},
eprinttype = {arXiv},
eprint = {1711.04520},
timestamp = {Fri, 09 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgi/FluschnikKRZRKR16,
author = {Till Fluschnik and
Steffen Kriewald and
Anselmo Garc{\'{\i}}a Cant{\'{u}} Ros and
Bin Zhou and
Dominik Reusser and
J{\"{u}}rgen P. Kropp and
Diego Rybski},
title = {The Size Distribution, Scaling Properties and Spatial Organization
of Urban Clusters: {A} Global and Regional Percolation Perspective},
journal = {{ISPRS} Int. J. Geo Inf.},
volume = {5},
number = {7},
pages = {110},
year = {2016},
url = {https://doi.org/10.3390/ijgi5070110},
doi = {10.3390/IJGI5070110},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgi/FluschnikKRZRKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FluschnikHNN16,
author = {Till Fluschnik and
Danny Hermelin and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded
Cut Problems},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.25},
doi = {10.4230/LIPICS.ICALP.2016.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FluschnikHNN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BevernFMMSS16,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
George B. Mertzios and
Hendrik Molter and
Manuel Sorge and
Ondrej Such{\'{y}}},
editor = {Jiong Guo and
Danny Hermelin},
title = {Finding Secluded Places of Special Interest in Graphs},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {5:1--5:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.5},
doi = {10.4230/LIPICS.IPEC.2016.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BevernFMMSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikS16,
author = {Till Fluschnik and
Manuel Sorge},
title = {The Minimum Shared Edges Problem on Planar Graphs},
journal = {CoRR},
volume = {abs/1602.01385},
year = {2016},
url = {http://arxiv.org/abs/1602.01385},
eprinttype = {arXiv},
eprint = {1602.01385},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikKNS16,
author = {Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge},
title = {The Parameterized Complexity of the Minimum Shared Edges Problem},
journal = {CoRR},
volume = {abs/1602.01739},
year = {2016},
url = {http://arxiv.org/abs/1602.01739},
eprinttype = {arXiv},
eprint = {1602.01739},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikKNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernFMMSS16,
author = {Ren{\'{e}} van Bevern and
Till Fluschnik and
George B. Mertzios and
Hendrik Molter and
Manuel Sorge and
Ondrej Such{\'{y}}},
title = {Finding Secluded Places of Special Interest in Graphs},
journal = {CoRR},
volume = {abs/1606.09000},
year = {2016},
url = {http://arxiv.org/abs/1606.09000},
eprinttype = {arXiv},
eprint = {1606.09000},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernFMMSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FernauFHKMN16,
author = {Henning Fernau and
Till Fluschnik and
Danny Hermelin and
Andreas Krebs and
Hendrik Molter and
Rolf Niedermeier},
title = {Diminishable Parameterized Problems and Strict Polynomial Kernelization},
journal = {CoRR},
volume = {abs/1611.03739},
year = {2016},
url = {http://arxiv.org/abs/1611.03739},
eprinttype = {arXiv},
eprint = {1611.03739},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FernauFHKMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FluschnikKNS15,
author = {Till Fluschnik and
Stefan Kratsch and
Rolf Niedermeier and
Manuel Sorge},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {The Parameterized Complexity of the Minimum Shared Edges Problem},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {448--462},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.448},
doi = {10.4230/LIPICS.FSTTCS.2015.448},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FluschnikKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FluschnikHNN15,
author = {Till Fluschnik and
Danny Hermelin and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded
Cut Problems},
journal = {CoRR},
volume = {abs/1512.00333},
year = {2015},
url = {http://arxiv.org/abs/1512.00333},
eprinttype = {arXiv},
eprint = {1512.00333},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FluschnikHNN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-03 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
