Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Hendrik Molter
@inproceedings{DBLP:conf/aaai/ChaudharyMZ24,
author = {Juhi Chaudhary and
Hendrik Molter and
Meirav Zehavi},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {How to Make Knockout Tournaments More Popular?},
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 = {9582--9589},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i9.28814},
doi = {10.1609/AAAI.V38I9.28814},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ChaudharyMZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-17587,
author = {Juhi Chaudhary and
Hendrik Molter and
Meirav Zehavi},
title = {Parameterized Analysis of Bribery in Challenge the Champ Tournaments},
journal = {CoRR},
volume = {abs/2403.17587},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.17587},
doi = {10.48550/ARXIV.2403.17587},
eprinttype = {arXiv},
eprint = {2403.17587},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-17587.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-18513,
author = {George B. Mertzios and
Hendrik Molter and
Paul G. Spirakis},
title = {Realizing temporal transportation trees},
journal = {CoRR},
volume = {abs/2403.18513},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.18513},
doi = {10.48550/ARXIV.2403.18513},
eprinttype = {arXiv},
eprint = {2403.18513},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-18513.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/KlobasMMNZ23,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
title = {Interference-free walks in time: temporally disjoint paths},
journal = {Auton. Agents Multi Agent Syst.},
volume = {37},
number = {1},
pages = {1},
year = {2023},
url = {https://doi.org/10.1007/s10458-022-09583-5},
doi = {10.1007/S10458-022-09583-5},
timestamp = {Tue, 22 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/KlobasMMNZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MaackMNR23,
author = {Nicolas Maack and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {On finding separators in temporal split and permutation graphs},
journal = {J. Comput. Syst. Sci.},
volume = {135},
pages = {1--14},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.01.004},
doi = {10.1016/J.JCSS.2023.01.004},
timestamp = {Fri, 21 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/MaackMNR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MertziosMNZZ23,
author = {George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche},
title = {Computing maximum matchings in temporal graphs},
journal = {J. Comput. Syst. Sci.},
volume = {137},
pages = {1--19},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.04.005},
doi = {10.1016/J.JCSS.2023.04.005},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/MertziosMNZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RymarMNN23,
author = {Maciej Rymar and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness
Centrality},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {3},
pages = {173--194},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00619},
doi = {10.7155/JGAA.00619},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/RymarMNN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/HeegerHMMNS23,
author = {Klaus Heeger and
Danny Hermelin and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable scheduling on a single machine},
journal = {J. Sched.},
volume = {26},
number = {2},
pages = {209--225},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00754-6},
doi = {10.1007/S10951-022-00754-6},
timestamp = {Sun, 16 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/HeegerHMMNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HermelinIMN23,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Rolf Niedermeier},
title = {Temporal interval cliques and independent sets},
journal = {Theor. Comput. Sci.},
volume = {961},
pages = {113885},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113885},
doi = {10.1016/J.TCS.2023.113885},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HermelinIMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KunzMZ23,
author = {Pascal Kunz and
Hendrik Molter and
Meirav Zehavi},
title = {In Which Graph Structures Can We Efficiently Find Temporally Disjoint
Paths and Walks?},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {180--188},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/21},
doi = {10.24963/IJCAI.2023/21},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KunzMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EnrightMM23,
author = {Jessica A. Enright and
Kitty Meeks and
Hendrik Molter},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Counting Temporal Paths},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {30:1--30:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.30},
doi = {10.4230/LIPICS.STACS.2023.30},
timestamp = {Fri, 03 Mar 2023 12:10:30 +0100},
biburl = {https://dblp.org/rec/conf/stacs/EnrightMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-10503,
author = {Pascal Kunz and
Hendrik Molter and
Meirav Zehavi},
title = {In Which Graph Structures Can We Efficiently Find Temporally Disjoint
Paths and Walks?},
journal = {CoRR},
volume = {abs/2301.10503},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10503},
doi = {10.48550/ARXIV.2301.10503},
eprinttype = {arXiv},
eprint = {2301.10503},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10503.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-08860,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Paul G. Spirakis},
title = {Realizing temporal graphs from fastest travel times},
journal = {CoRR},
volume = {abs/2302.08860},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.08860},
doi = {10.48550/ARXIV.2302.08860},
eprinttype = {arXiv},
eprint = {2302.08860},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-08860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-09967,
author = {Juhi Chaudhary and
Hendrik Molter and
Meirav Zehavi},
title = {How to Make Knockout Tournaments More Popular?},
journal = {CoRR},
volume = {abs/2309.09967},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.09967},
doi = {10.48550/ARXIV.2309.09967},
eprinttype = {arXiv},
eprint = {2309.09967},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-09967.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HaagMNR22,
author = {Roman Haag and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {Feedback edge sets in temporal graphs},
journal = {Discret. Appl. Math.},
volume = {307},
pages = {65--78},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.09.029},
doi = {10.1016/J.DAM.2021.09.029},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HaagMNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Molter22,
author = {Hendrik Molter},
title = {The complexity of finding temporal separators under waiting time constraints},
journal = {Inf. Process. Lett.},
volume = {175},
pages = {106229},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106229},
doi = {10.1016/J.IPL.2021.106229},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Molter22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HermelinIMS22,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Dvir Shabtay},
editor = {Holger Dell and
Jesper Nederlof},
title = {Hardness of Interval Scheduling on Unrelated Machines},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.18},
doi = {10.4230/LIPICS.IPEC.2022.18},
timestamp = {Wed, 14 Dec 2022 11:56:17 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/HermelinIMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KlobasMMS22,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Paul G. Spirakis},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {The Complexity of Computing Optimum Labelings for Temporal Connectivity},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {62:1--62:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.62},
doi = {10.4230/LIPICS.MFCS.2022.62},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KlobasMMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/FuchsleMNR22,
author = {Eugen F{\"{u}}chsle and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
editor = {James Aspnes and
Othon Michail},
title = {Temporal Connectivity: Coping with Foreseen and Unforeseen Delays},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {17:1--17:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.17},
doi = {10.4230/LIPICS.SAND.2022.17},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sand/FuchsleMNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/HermelinIMN22,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Rolf Niedermeier},
editor = {James Aspnes and
Othon Michail},
title = {Temporal Unit Interval Independent Sets},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {19:1--19:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.19},
doi = {10.4230/LIPICS.SAND.2022.19},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sand/HermelinIMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FuchsleMNR22,
author = {Eugen F{\"{u}}chsle and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Delay-Robust Routes in Temporal Graphs},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.30},
doi = {10.4230/LIPICS.STACS.2022.30},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FuchsleMNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05011,
author = {Eugen F{\"{u}}chsle and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {Temporal Connectivity: Coping with Foreseen and Unforeseen Delays},
journal = {CoRR},
volume = {abs/2201.05011},
year = {2022},
url = {https://arxiv.org/abs/2201.05011},
eprinttype = {arXiv},
eprint = {2201.05011},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05390,
author = {Eugen F{\"{u}}chsle and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {Delay-Robust Routes in Temporal Graphs},
journal = {CoRR},
volume = {abs/2201.05390},
year = {2022},
url = {https://arxiv.org/abs/2201.05390},
eprinttype = {arXiv},
eprint = {2201.05390},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05390.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05880,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Paul G. Spirakis},
title = {The complexity of computing optimum labelings for temporal connectivity},
journal = {CoRR},
volume = {abs/2202.05880},
year = {2022},
url = {https://arxiv.org/abs/2202.05880},
eprinttype = {arXiv},
eprint = {2202.05880},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05880.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06841,
author = {Danny Hermelin and
Hendrik Molter and
Dvir Shabtay},
title = {Single Machine Weighted Number of Tardy Jobs Minimization With Small
Weights},
journal = {CoRR},
volume = {abs/2202.06841},
year = {2022},
url = {https://arxiv.org/abs/2202.06841},
eprinttype = {arXiv},
eprint = {2202.06841},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06841.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-12055,
author = {Jessica A. Enright and
Kitty Meeks and
Hendrik Molter},
title = {Counting Temporal Paths},
journal = {CoRR},
volume = {abs/2202.12055},
year = {2022},
url = {https://arxiv.org/abs/2202.12055},
eprinttype = {arXiv},
eprint = {2202.12055},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-12055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12825,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Dvir Shabtay},
title = {Hardness of Interval Scheduling on Unrelated Machines},
journal = {CoRR},
volume = {abs/2206.12825},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.12825},
doi = {10.48550/ARXIV.2206.12825},
eprinttype = {arXiv},
eprint = {2206.12825},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-12825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LuoMNN21,
author = {Junjie Luo and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Parameterized Dynamic Cluster Editing},
journal = {Algorithmica},
volume = {83},
number = {1},
pages = {1--44},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00746-y},
doi = {10.1007/S00453-020-00746-Y},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LuoMNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CasteigtsHMZ21,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
title = {Finding Temporal Paths Under Waiting Time Constraints},
journal = {Algorithmica},
volume = {83},
number = {9},
pages = {2754--2802},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00831-w},
doi = {10.1007/S00453-021-00831-W},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CasteigtsHMZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MertziosMZ21,
author = {George B. Mertzios and
Hendrik Molter and
Viktor Zamaraev},
title = {Sliding window temporal graph coloring},
journal = {J. Comput. Syst. Sci.},
volume = {120},
pages = {97--115},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.03.005},
doi = {10.1016/J.JCSS.2021.03.005},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/MertziosMZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LuoMS21,
author = {Junjie Luo and
Hendrik Molter and
Ondrej Such{\'{y}}},
title = {A Parameterized Complexity View on Collapsing k-Cores},
journal = {Theory Comput. Syst.},
volume = {65},
number = {8},
pages = {1243--1282},
year = {2021},
url = {https://doi.org/10.1007/s00224-021-10045-w},
doi = {10.1007/S00224-021-10045-W},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/LuoMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netsci/MolterNR21,
author = {Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {Isolation concepts applied to temporal clique enumeration},
journal = {Netw. Sci.},
volume = {9},
number = {{S1}},
pages = {S83--S105},
year = {2021},
url = {https://doi.org/10.1017/nws.2020.38},
doi = {10.1017/NWS.2020.38},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/netsci/MolterNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HeegerHMMNS21,
author = {Klaus Heeger and
Danny Hermelin and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable Scheduling on a Single Machine},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {11818--11825},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i13.17404},
doi = {10.1609/AAAI.V35I13.17404},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HeegerHMMNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/MaackMNR21,
author = {Nicolas Maack and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {On Finding Separators in Temporal Split and Permutation Graphs},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {385--398},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_27},
doi = {10.1007/978-3-030-86593-1\_27},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/MaackMNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KlobasMMNZ21,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
editor = {Zhi{-}Hua Zhou},
title = {Interference-free Walks in Time: Temporally Disjoint Paths},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {4090--4096},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/563},
doi = {10.24963/IJCAI.2021/563},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KlobasMMNZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MertziosMRSZ21,
author = {George B. Mertzios and
Hendrik Molter and
Malte Renken and
Paul G. Spirakis and
Philipp Zschoche},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {The Complexity of Transitively Orienting Temporal Graphs},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {75:1--75:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.75},
doi = {10.4230/LIPICS.MFCS.2021.75},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MertziosMRSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MolterRZ21,
author = {Hendrik Molter and
Malte Renken and
Philipp Zschoche},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Temporal Reachability Minimization: Delaying vs. Deleting},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {76:1--76:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.76},
doi = {10.4230/LIPICS.MFCS.2021.76},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MolterRZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/RymarMNN21,
author = {Maciej Rymar and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness
Centrality},
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 = {219--231},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_17},
doi = {10.1007/978-3-030-86838-3\_17},
timestamp = {Tue, 21 Sep 2021 19:14:12 +0200},
biburl = {https://dblp.org/rec/conf/wg/RymarMNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06783,
author = {George B. Mertzios and
Hendrik Molter and
Malte Renken and
Paul G. Spirakis and
Philipp Zschoche},
title = {The Complexity of Transitively Orienting Temporal Graphs},
journal = {CoRR},
volume = {abs/2102.06783},
year = {2021},
url = {https://arxiv.org/abs/2102.06783},
eprinttype = {arXiv},
eprint = {2102.06783},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-10814,
author = {Hendrik Molter and
Malte Renken and
Philipp Zschoche},
title = {Temporal Reachability Minimization: Delaying vs. Deleting},
journal = {CoRR},
volume = {abs/2102.10814},
year = {2021},
url = {https://arxiv.org/abs/2102.10814},
eprinttype = {arXiv},
eprint = {2102.10814},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-10814.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08335,
author = {Nina Klobas and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Philipp Zschoche},
title = {Interference-free Walks in Time: Temporally Disjoint Paths},
journal = {CoRR},
volume = {abs/2105.08335},
year = {2021},
url = {https://arxiv.org/abs/2105.08335},
eprinttype = {arXiv},
eprint = {2105.08335},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08335.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-12003,
author = {Nicolas Maack and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {On Finding Separators in Temporal Split and Permutation Graphs},
journal = {CoRR},
volume = {abs/2105.12003},
year = {2021},
url = {https://arxiv.org/abs/2105.12003},
eprinttype = {arXiv},
eprint = {2105.12003},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-12003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-13055,
author = {Maciej Rymar and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness
Centrality},
journal = {CoRR},
volume = {abs/2105.13055},
year = {2021},
url = {https://arxiv.org/abs/2105.13055},
eprinttype = {arXiv},
eprint = {2105.13055},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-13055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-01609,
author = {Hendrik Molter},
title = {The Complexity of Finding Temporal Separators under Waiting Time Constraints},
journal = {CoRR},
volume = {abs/2107.01609},
year = {2021},
url = {https://arxiv.org/abs/2107.01609},
eprinttype = {arXiv},
eprint = {2107.01609},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-01609.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-06172,
author = {Danny Hermelin and
Yuval Itzhaki and
Hendrik Molter and
Rolf Niedermeier},
title = {Temporal Unit Interval Independent Sets},
journal = {CoRR},
volume = {abs/2112.06172},
year = {2021},
url = {https://arxiv.org/abs/2112.06172},
eprinttype = {arXiv},
eprint = {2112.06172},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-06172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-13824,
author = {Danny Hermelin and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable Scheduling for the Total Completion Time Objective},
journal = {CoRR},
volume = {abs/2112.13824},
year = {2021},
url = {https://arxiv.org/abs/2112.13824},
eprinttype = {arXiv},
eprint = {2112.13824},
timestamp = {Tue, 04 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-13824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Molter20,
author = {Hendrik Molter},
title = {Classic graph problems made temporal - a parameterized complexity
analysis},
school = {Technical University of Berlin, Germany},
year = {2020},
url = {https://nbn-resolving.org/urn:nbn:de:101:1-2020120901012282017374},
urn = {urn:nbn:de:101:1-2020120901012282017374},
isbn = {978-3-7983-3172-3},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Molter20.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/jco/MillaniMNS20,
author = {Marcelo Garlet Millani and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Efficient algorithms for measuring the funnel-likeness of DAGs},
journal = {J. Comb. Optim.},
volume = {39},
number = {1},
pages = {216--245},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00464-4},
doi = {10.1007/S10878-019-00464-4},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/MillaniMNS20.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/qss/BevernKMNSW20,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
title = {h-Index manipulation by undoing merges},
journal = {Quant. Sci. Stud.},
volume = {1},
number = {4},
pages = {1529--1552},
year = {2020},
url = {https://doi.org/10.1162/qss\_a\_00093},
doi = {10.1162/QSS\_A\_00093},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qss/BevernKMNSW20.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/CasteigtsHMZ20,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Finding Temporal Paths Under Waiting Time Constraints},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {30:1--30:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.30},
doi = {10.4230/LIPICS.ISAAC.2020.30},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CasteigtsHMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/BussMNR20,
author = {Sebastian Bu{\ss} and
Hendrik Molter and
Rolf Niedermeier and
Maciej Rymar},
editor = {Rajesh Gupta and
Yan Liu and
Jiliang Tang and
B. Aditya Prakash},
title = {Algorithmic Aspects of Temporal Betweenness},
booktitle = {{KDD} '20: The 26th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, Virtual Event, CA, USA, August 23-27, 2020},
pages = {2084--2092},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3394486.3403259},
doi = {10.1145/3394486.3403259},
timestamp = {Tue, 20 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kdd/BussMNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MertziosMNZZ20,
author = {George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Computing Maximum Matchings in Temporal Graphs},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.27},
doi = {10.4230/LIPICS.STACS.2020.27},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MertziosMNZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HaagMNR20,
author = {Roman Haag and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Feedback Edge Sets in Temporal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {200--212},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_16},
doi = {10.1007/978-3-030-60440-0\_16},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/HaagMNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-13641,
author = {Roman Haag and
Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {Feedback Edge Sets in Temporal Graphs},
journal = {CoRR},
volume = {abs/2003.13641},
year = {2020},
url = {https://arxiv.org/abs/2003.13641},
eprinttype = {arXiv},
eprint = {2003.13641},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-13641.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-2006-08668,
author = {Sebastian Bu{\ss} and
Hendrik Molter and
Rolf Niedermeier and
Maciej Rymar},
title = {Algorithmic Aspects of Temporal Betweenness},
journal = {CoRR},
volume = {abs/2006.08668},
year = {2020},
url = {https://arxiv.org/abs/2006.08668},
eprinttype = {arXiv},
eprint = {2006.08668},
timestamp = {Tue, 20 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-08668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-04643,
author = {Klaus Heeger and
Danny Hermelin and
George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Dvir Shabtay},
title = {Equitable Scheduling on a Single Machine},
journal = {CoRR},
volume = {abs/2010.04643},
year = {2020},
url = {https://arxiv.org/abs/2010.04643},
eprinttype = {arXiv},
eprint = {2010.04643},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-04643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BentertHMMNS19,
author = {Matthias Bentert and
Anne{-}Sophie Himmel and
Hendrik Molter and
Marco Morik and
Rolf Niedermeier and
Ren{\'{e}} Saitenmacher},
title = {Listing All Maximal \emph{k}-Plexes in Temporal Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.13:1--1.13:27},
year = {2019},
url = {https://doi.org/10.1145/3325859},
doi = {10.1145/3325859},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BentertHMMNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netsci/BredereckKKMNS19,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Assessing the computational complexity of multilayer subgraph detection},
journal = {Netw. Sci.},
volume = {7},
number = {2},
pages = {215--241},
year = {2019},
url = {https://doi.org/10.1017/nws.2019.13},
doi = {10.1017/NWS.2019.13},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/netsci/BredereckKKMNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/MertziosMZ19,
author = {George B. Mertzios and
Hendrik Molter and
Viktor Zamaraev},
title = {Sliding Window Temporal Graph Coloring},
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 = {7667--7674},
publisher = {{AAAI} Press},
year = {2019},
url = {https://doi.org/10.1609/aaai.v33i01.33017667},
doi = {10.1609/AAAI.V33I01.33017667},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/MertziosMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complexnetworks/MolterNR19,
author = {Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
editor = {Hocine Cherifi and
Sabrina Gaito and
Jos{\'{e}} Fernendo Mendes and
Esteban Moro and
Luis Mateus Rocha},
title = {Enumerating Isolated Cliques in Temporal Networks},
booktitle = {Complex Networks and Their Applications {VIII} - Volume 2 Proceedings
of the Eighth International Conference on Complex Networks and Their
Applications {COMPLEX} {NETWORKS} 2019, Lisbon, Portugal, December
10-12, 2019},
series = {Studies in Computational Intelligence},
volume = {882},
pages = {519--531},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-36683-4\_42},
doi = {10.1007/978-3-030-36683-4\_42},
timestamp = {Sun, 02 Oct 2022 15:57:51 +0200},
biburl = {https://dblp.org/rec/conf/complexnetworks/MolterNR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-05304,
author = {George B. Mertzios and
Hendrik Molter and
Rolf Niedermeier and
Viktor Zamaraev and
Philipp Zschoche},
title = {Computing Maximum Matchings in Temporal Graphs},
journal = {CoRR},
volume = {abs/1905.05304},
year = {2019},
url = {http://arxiv.org/abs/1905.05304},
eprinttype = {arXiv},
eprint = {1905.05304},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-05304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-06292,
author = {Hendrik Molter and
Rolf Niedermeier and
Malte Renken},
title = {Enumerating Isolated Cliques in Temporal Networks},
journal = {CoRR},
volume = {abs/1909.06292},
year = {2019},
url = {http://arxiv.org/abs/1909.06292},
eprinttype = {arXiv},
eprint = {1909.06292},
timestamp = {Wed, 18 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-06292.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-06437,
author = {Arnaud Casteigts and
Anne{-}Sophie Himmel and
Hendrik Molter and
Philipp Zschoche},
title = {The Computational Complexity of Finding Temporal Paths under Waiting
Time Constraints},
journal = {CoRR},
volume = {abs/1909.06437},
year = {2019},
url = {http://arxiv.org/abs/1909.06437},
eprinttype = {arXiv},
eprint = {1909.06437},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-06437.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}
}
@inproceedings{DBLP:conf/asunam/BentertHMMNS18,
author = {Matthias Bentert and
Anne{-}Sophie Himmel and
Hendrik Molter and
Marco Morik and
Rolf Niedermeier and
Ren{\'{e}} Saitenmacher},
editor = {Ulrik Brandes and
Chandan Reddy and
Andrea Tagarelli},
title = {Listing All Maximal k-Plexes in Temporal Graphs},
booktitle = {{IEEE/ACM} 2018 International Conference on Advances in Social Networks
Analysis and Mining, {ASONAM} 2018, Barcelona, Spain, August 28-31,
2018},
pages = {41--46},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/ASONAM.2018.8508847},
doi = {10.1109/ASONAM.2018.8508847},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/asunam/BentertHMMNS18.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/fsttcs/LuoMNN18,
author = {Junjie Luo and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Sumit Ganguly and
Paritosh K. Pandya},
title = {Parameterized Dynamic Cluster Editing},
booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018,
Ahmedabad, India},
series = {LIPIcs},
volume = {122},
pages = {46:1--46:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.46},
doi = {10.4230/LIPICS.FSTTCS.2018.46},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/LuoMNN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenMSS18,
author = {Jiehua Chen and
Hendrik Molter and
Manuel Sorge and
Ondrej Such{\'{y}}},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Cluster Editing in Multi-Layer and Temporal Graphs},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.24},
doi = {10.4230/LIPICS.ISAAC.2018.24},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenMSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/MillaniMNS18,
author = {Marcelo Garlet Millani and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
editor = {Jon Lee and
Giovanni Rinaldi and
Ali Ridha Mahjoub},
title = {Efficient Algorithms for Measuring the Funnel-Likeness of DAGs},
booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10856},
pages = {183--195},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96151-4\_16},
doi = {10.1007/978-3-319-96151-4\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/MillaniMNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/LuoMS18,
author = {Junjie Luo and
Hendrik Molter and
Ondrej Such{\'{y}}},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {A Parameterized Complexity View on Collapsing k-Cores},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {7:1--7:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.7},
doi = {10.4230/LIPICS.IPEC.2018.7},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/LuoMS18.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/sofsem/0002MS18,
author = {Clemens Hoffmann and
Hendrik Molter and
Manuel Sorge},
editor = {A Min Tjoa and
Ladjel Bellatreche and
Stefan Biffl and
Jan van Leeuwen and
Jir{\'{\i}} Wiedermann},
title = {The Parameterized Complexity of Centrality Improvement in Networks},
booktitle = {{SOFSEM} 2018: Theory and Practice of Computer Science - 44th International
Conference on Current Trends in Theory and Practice of Computer Science,
Krems, Austria, January 29 - February 2, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10706},
pages = {111--124},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-73117-9\_8},
doi = {10.1007/978-3-319-73117-9\_8},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/0002MS18.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-1801-10401,
author = {Marcelo Garlet Millani and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Efficient Algorithms for Measuring the Funnel-likeness of DAGs},
journal = {CoRR},
volume = {abs/1801.10401},
year = {2018},
url = {http://arxiv.org/abs/1801.10401},
eprinttype = {arXiv},
eprint = {1801.10401},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-10401.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-1805-12453,
author = {Junjie Luo and
Hendrik Molter and
Ondrej Such{\'{y}}},
title = {A Parameterized Complexity View on Collapsing k-Cores},
journal = {CoRR},
volume = {abs/1805.12453},
year = {2018},
url = {http://arxiv.org/abs/1805.12453},
eprinttype = {arXiv},
eprint = {1805.12453},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-12453.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-10210,
author = {Matthias Bentert and
Anne{-}Sophie Himmel and
Hendrik Molter and
Marco Morik and
Rolf Niedermeier and
Ren{\'{e}} Saitenmacher},
title = {Listing All Maximal k-Plexes in Temporal Graphs},
journal = {CoRR},
volume = {abs/1806.10210},
year = {2018},
url = {http://arxiv.org/abs/1806.10210},
eprinttype = {arXiv},
eprint = {1806.10210},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-10210.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-06625,
author = {Junjie Luo and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Parameterized Dynamic Cluster Editing},
journal = {CoRR},
volume = {abs/1810.06625},
year = {2018},
url = {http://arxiv.org/abs/1810.06625},
eprinttype = {arXiv},
eprint = {1810.06625},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-06625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04753,
author = {George B. Mertzios and
Hendrik Molter and
Viktor Zamaraev},
title = {Sliding Window Temporal Graph Coloring},
journal = {CoRR},
volume = {abs/1811.04753},
year = {2018},
url = {http://arxiv.org/abs/1811.04753},
eprinttype = {arXiv},
eprint = {1811.04753},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04753.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/snam/HimmelMNS17,
author = {Anne{-}Sophie Himmel and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques
in temporal graphs},
journal = {Soc. Netw. Anal. Min.},
volume = {7},
number = {1},
pages = {35:1--35:16},
year = {2017},
url = {https://doi.org/10.1007/s13278-017-0455-0},
doi = {10.1007/S13278-017-0455-0},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/snam/HimmelMNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BredereckKKMNS17,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Assessing the Computational Complexity of Multi-layer Subgraph Detection},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {128--139},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_12},
doi = {10.1007/978-3-319-57586-5\_12},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BredereckKKMNS17.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/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/abs-1709-09100,
author = {Jiehua Chen and
Hendrik Molter and
Manuel Sorge and
Ondrej Such{\'{y}}},
title = {A Parameterized View on Multi-Layer Cluster Editing},
journal = {CoRR},
volume = {abs/1709.09100},
year = {2017},
url = {http://arxiv.org/abs/1709.09100},
eprinttype = {arXiv},
eprint = {1709.09100},
timestamp = {Mon, 27 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-09100.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-01576,
author = {Clemens Hoffmann and
Hendrik Molter and
Manuel Sorge},
title = {The Parameterized Complexity of Centrality Improvement in Networks},
journal = {CoRR},
volume = {abs/1710.01576},
year = {2017},
url = {http://arxiv.org/abs/1710.01576},
eprinttype = {arXiv},
eprint = {1710.01576},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-01576.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/im/AlvarezBM16,
author = {Carme {\`{A}}lvarez and
Maria J. Blesa and
Hendrik Molter},
title = {Firefighting as a Strategic Game},
journal = {Internet Math.},
volume = {12},
number = {1-2},
pages = {101--120},
year = {2016},
url = {https://doi.org/10.1080/15427951.2015.1110542},
doi = {10.1080/15427951.2015.1110542},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/AlvarezBM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asunam/HimmelMNS16,
author = {Anne{-}Sophie Himmel and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
editor = {Ravi Kumar and
James Caverlee and
Hanghang Tong},
title = {Enumerating maximal cliques in temporal graphs},
booktitle = {2016 {IEEE/ACM} International Conference on Advances in Social Networks
Analysis and Mining, {ASONAM} 2016, San Francisco, CA, USA, August
18-21, 2016},
pages = {337--344},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/ASONAM.2016.7752255},
doi = {10.1109/ASONAM.2016.7752255},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/asunam/HimmelMNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BevernKMNSW16,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
editor = {Gal A. Kaminka and
Maria Fox and
Paolo Bouquet and
Eyke H{\"{u}}llermeier and
Virginia Dignum and
Frank Dignum and
Frank van Harmelen},
title = {h-Index Manipulation by Undoing Merges},
booktitle = {{ECAI} 2016 - 22nd European Conference on Artificial Intelligence,
29 August-2 September 2016, The Hague, The Netherlands - Including
Prestigious Applications of Artificial Intelligence {(PAIS} 2016)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {285},
pages = {895--903},
publisher = {{IOS} Press},
year = {2016},
url = {https://doi.org/10.3233/978-1-61499-672-9-895},
doi = {10.3233/978-1-61499-672-9-895},
timestamp = {Tue, 02 Nov 2021 15:59:05 +0100},
biburl = {https://dblp.org/rec/conf/ecai/BevernKMNSW16.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/BevernKMNSW16,
author = {Ren{\'{e}} van Bevern and
Christian Komusiewicz and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge and
Toby Walsh},
title = {h-Index Manipulation by Undoing Merges},
journal = {CoRR},
volume = {abs/1604.04827},
year = {2016},
url = {http://arxiv.org/abs/1604.04827},
eprinttype = {arXiv},
eprint = {1604.04827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKMNSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BredereckKKMNS16,
author = {Robert Bredereck and
Christian Komusiewicz and
Stefan Kratsch and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Assessing the Computational Complexity of Multi-Layer Subgraph Detection},
journal = {CoRR},
volume = {abs/1604.07724},
year = {2016},
url = {http://arxiv.org/abs/1604.07724},
eprinttype = {arXiv},
eprint = {1604.07724},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BredereckKKMNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HimmelMNS16,
author = {Anne{-}Sophie Himmel and
Hendrik Molter and
Rolf Niedermeier and
Manuel Sorge},
title = {Enumerating Maximal Cliques in Temporal Graphs},
journal = {CoRR},
volume = {abs/1605.03871},
year = {2016},
url = {http://arxiv.org/abs/1605.03871},
eprinttype = {arXiv},
eprint = {1605.03871},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HimmelMNS16.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/waw/AlvarezBM14,
author = {Carme {\`{A}}lvarez and
Maria J. Blesa and
Hendrik Molter},
editor = {Anthony Bonato and
Fan Chung Graham and
Pawel Pralat},
title = {Firefighting as a Game},
booktitle = {Algorithms and Models for the Web Graph - 11th International Workshop,
{WAW} 2014, Beijing, China, December 17-18, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8882},
pages = {108--119},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13123-8\_9},
doi = {10.1007/978-3-319-13123-8\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/waw/AlvarezBM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/KotzingM12,
author = {Timo K{\"{o}}tzing and
Hendrik Molter},
editor = {Carlos A. Coello Coello and
Vincenzo Cutello and
Kalyanmoy Deb and
Stephanie Forrest and
Giuseppe Nicosia and
Mario Pavone},
title = {{ACO} Beats {EA} on a Dynamic Pseudo-Boolean Function},
booktitle = {Parallel Problem Solving from Nature - {PPSN} {XII} - 12th International
Conference, Taormina, Italy, September 1-5, 2012, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {7491},
pages = {113--122},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32937-1\_12},
doi = {10.1007/978-3-642-32937-1\_12},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/KotzingM12.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-11 20:11 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:
