Hendrik Molter

131 papers A* 10A 5B 20C 4Journal 84Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Adaptive Manipulation for Coalitions in Knockout Tournaments. AAAI Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2025	J	`jnl`	Counting Temporal Paths. Algorithmica Jessica A. Enright, Kitty Meeks, Hendrik Molter
2025	J	`jnl`	Fair Repetitive Interval Scheduling. Algorithmica Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2025	J	`jnl`	Fairness in repetitive scheduling. Eur. J. Oper. Res. Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Michael L. Pinedo, Dvir Shabtay
2025	A	`conf`	Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. STACS Klaus Heeger, Hendrik Molter
2025	J	`jnl`	On Kernelization with Access to NP-Oracles. CoRR Hendrik Molter, Meirav Zehavi
2025	J	`jnl`	Parameterized Analysis of Bribery in Challenge the Champ Tournaments. J. Artif. Intell. Res. Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2025	B	`conf`	Realizing Temporal Transportation Trees. WG George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	J	`jnl`	Temporal Graph Realization With Bounded Stretch. CoRR George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	B	`conf`	Temporal Graph Realization with Bounded Stretch. MFCS George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	J	`jnl`	Temporal graph realization from fastest paths. Theor. Comput. Sci. Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2025	J	`jnl`	The complexity of transitively orienting temporal graphs. J. Comput. Syst. Sci. George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
2025	A*	`conf`	Tournament Robustness via Redundancy. EC Klim Efremenko, Hendrik Molter, Meirav Zehavi
2025	J	`jnl`	Tournament Robustness via Redundancy. CoRR Klim Efremenko, Hendrik Molter, Meirav Zehavi
2025	A*	`conf`	Treewidth Parameterized by Feedback Vertex Number. ICALP Hendrik Molter, Meirav Zehavi, Amit Zivan
2025	J	`jnl`	Treewidth Parameterized by Feedback Vertex Number. CoRR Hendrik Molter, Meirav Zehavi, Amit Zivan
2024	J	`jnl`	Adaptive Manipulation for Coalitions in Knockout Tournaments. CoRR Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	J	`jnl`	Algorithmic aspects of temporal betweenness. Netw. Sci. Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
2024	J	`jnl`	Cluster Editing for Multi-Layer and Temporal Graphs. Theory Comput. Syst. Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2024	J	`jnl`	Fair Repetitive Interval Scheduling. CoRR Klaus Heeger, Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2024	A*	`conf`	How to Make Knockout Tournaments More Popular? AAAI Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	J	`jnl`	Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines. CoRR Klaus Heeger, Hendrik Molter
2024	J	`jnl`	Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS J. Comput. Danny Hermelin, Hendrik Molter, Dvir Shabtay
2024	J	`jnl`	On the parameterized complexity of interval scheduling with eligible machine sets. J. Comput. Syst. Sci. Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2024	A*	`conf`	Parameterized Analysis of Bribery in Challenge the Champ Tournaments. IJCAI Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	J	`jnl`	Parameterized Analysis of Bribery in Challenge the Champ Tournaments. CoRR Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2024	J	`jnl`	Realizing temporal transportation trees. CoRR George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2024	B	`conf`	Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. IPEC Matthias Kaul, Matthias Mnich, Hendrik Molter
2024	J	`jnl`	Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. CoRR Matthias Kaul, Matthias Mnich, Hendrik Molter
2024	—	`conf`	Temporal Graph Realization from Fastest Paths. SAND Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2024	J	`jnl`	Temporal reachability minimization: Delaying vs. deleting. J. Comput. Syst. Sci. Hendrik Molter, Malte Renken, Philipp Zschoche
2024	J	`jnl`	The complexity of computing optimum labelings for temporal connectivity. J. Comput. Syst. Sci. Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2023	J	`jnl`	Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2023	A	`conf`	Counting Temporal Paths. STACS Jessica A. Enright, Kitty Meeks, Hendrik Molter
2023	J	`jnl`	Equitable scheduling on a single machine. J. Sched. Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2023	J	`jnl`	How to Make Knockout Tournaments More Popular? CoRR Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
2023	A*	`conf`	In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI Pascal Kunz, Hendrik Molter, Meirav Zehavi
2023	J	`jnl`	In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR Pascal Kunz, Hendrik Molter, Meirav Zehavi
2023	J	`jnl`	Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2023	J	`jnl`	On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
2023	J	`jnl`	Realizing temporal graphs from fastest travel times. CoRR Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2023	J	`jnl`	Temporal interval cliques and independent sets. Theor. Comput. Sci. Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2023	J	`jnl`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2022	J	`jnl`	Counting Temporal Paths. CoRR Jessica A. Enright, Kitty Meeks, Hendrik Molter
2022	A	`conf`	Delay-Robust Routes in Temporal Graphs. STACS Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Delay-Robust Routes in Temporal Graphs. CoRR Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Feedback edge sets in temporal graphs. Discret. Appl. Math. Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	B	`conf`	Hardness of Interval Scheduling on Unrelated Machines. IPEC Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2022	J	`jnl`	Hardness of Interval Scheduling on Unrelated Machines. CoRR Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay
2022	J	`jnl`	Single Machine Weighted Number of Tardy Jobs Minimization With Small Weights. CoRR Danny Hermelin, Hendrik Molter, Dvir Shabtay
2022	—	`conf`	Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. SAND Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	J	`jnl`	Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. CoRR Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
2022	—	`conf`	Temporal Unit Interval Independent Sets. SAND Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2022	B	`conf`	The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2022	J	`jnl`	The complexity of computing optimum labelings for temporal connectivity. CoRR Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2022	J	`jnl`	The complexity of finding temporal separators under waiting time constraints. Inf. Process. Lett. Hendrik Molter
2021	J	`jnl`	A Parameterized Complexity View on Collapsing k-Cores. Theory Comput. Syst. Junjie Luo, Hendrik Molter, Ondrej Suchý
2021	J	`jnl`	Equitable Scheduling for the Total Completion Time Objective. CoRR Danny Hermelin, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	A*	`conf`	Equitable Scheduling on a Single Machine. AAAI Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2021	J	`jnl`	Finding Temporal Paths Under Waiting Time Constraints. Algorithmica Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
2021	A*	`conf`	Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Interference-free Walks in Time: Temporally Disjoint Paths. CoRR Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Isolation concepts applied to temporal clique enumeration. Netw. Sci. Hendrik Molter, Rolf Niedermeier, Malte Renken
2021	B	`conf`	On Finding Separators in Temporal Split and Permutation Graphs. FCT Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	On Finding Separators in Temporal Split and Permutation Graphs. CoRR Nicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken
2021	J	`jnl`	Parameterized Dynamic Cluster Editing. Algorithmica Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Sliding window temporal graph coloring. J. Comput. Syst. Sci. George B. Mertzios, Hendrik Molter, Viktor Zamaraev
2021	B	`conf`	Temporal Reachability Minimization: Delaying vs. Deleting. MFCS Hendrik Molter, Malte Renken, Philipp Zschoche
2021	J	`jnl`	Temporal Reachability Minimization: Delaying vs. Deleting. CoRR Hendrik Molter, Malte Renken, Philipp Zschoche
2021	J	`jnl`	Temporal Unit Interval Independent Sets. CoRR Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier
2021	J	`jnl`	The Complexity of Finding Temporal Separators under Waiting Time Constraints. CoRR Hendrik Molter
2021	B	`conf`	The Complexity of Transitively Orienting Temporal Graphs. MFCS George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
2021	J	`jnl`	The Complexity of Transitively Orienting Temporal Graphs. CoRR George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
2021	B	`conf`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2020	A*	`conf`	Algorithmic Aspects of Temporal Betweenness. KDD Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
2020	J	`jnl`	Algorithmic Aspects of Temporal Betweenness. CoRR Sebastian Buß, Hendrik Molter, Rolf Niedermeier, Maciej Rymar
2020	—	`conf`	As Time Goes By: Reflections on Treewidth for Temporal Graphs. Treewidth, Kernels, and Algorithms Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	As Time Goes By: Reflections on Treewidth for Temporal Graphs. CoRR Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	—	`—`	Classic graph problems made temporal - a parameterized complexity analysis. Hendrik Molter
2020	A	`conf`	Computing Maximum Matchings in Temporal Graphs. STACS George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2020	J	`jnl`	Diminishable parameterized problems and strict polynomial kernelization. Comput. Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	Efficient algorithms for measuring the funnel-likeness of DAGs. J. Comb. Optim. Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2020	J	`jnl`	Equitable Scheduling on a Single Machine. CoRR Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
2020	B	`conf`	Feedback Edge Sets in Temporal Graphs. WG Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
2020	J	`jnl`	Feedback Edge Sets in Temporal Graphs. CoRR Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
2020	B	`conf`	Finding Temporal Paths Under Waiting Time Constraints. ISAAC Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
2020	J	`jnl`	Temporal graph classes: A view through temporal separators. Theor. Comput. Sci. Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche
2020	J	`jnl`	The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2020	J	`jnl`	h-Index manipulation by undoing merges. Quant. Sci. Stud. René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2019	J	`jnl`	Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2019	J	`jnl`	Computing Maximum Matchings in Temporal Graphs. CoRR George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2019	—	`conf`	Enumerating Isolated Cliques in Temporal Networks. COMPLEX NETWORKS (2) Hendrik Molter, Rolf Niedermeier, Malte Renken
2019	J	`jnl`	Enumerating Isolated Cliques in Temporal Networks. CoRR Hendrik Molter, Rolf Niedermeier, Malte Renken
2019	J	`jnl`	Listing All Maximal ACM J. Exp. Algorithmics Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2019	A*	`conf`	Sliding Window Temporal Graph Coloring. AAAI George B. Mertzios, Hendrik Molter, Viktor Zamaraev
2019	J	`jnl`	The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
2018	B	`conf`	A Parameterized Complexity View on Collapsing k-Cores. IPEC Junjie Luo, Hendrik Molter, Ondrej Suchý
2018	J	`jnl`	A Parameterized Complexity View on Collapsing k-Cores. CoRR Junjie Luo, Hendrik Molter, Ondrej Suchý
2018	B	`conf`	Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2018	C	`conf`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CiE Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2018	C	`conf`	Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. ISCO Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2018	J	`jnl`	Efficient Algorithms for Measuring the Funnel-likeness of DAGs. CoRR Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2018	B	`conf`	Listing All Maximal k-Plexes in Temporal Graphs. ASONAM Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2018	J	`jnl`	Listing All Maximal k-Plexes in Temporal Graphs. CoRR Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher
2018	—	`conf`	Parameterized Dynamic Cluster Editing. FSTTCS Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Parameterized Dynamic Cluster Editing. CoRR Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Sliding Window Temporal Graph Coloring. CoRR George B. Mertzios, Hendrik Molter, Viktor Zamaraev
2018	B	`conf`	Temporal Graph Classes: A View Through Temporal Separators. WG Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2018	J	`jnl`	Temporal Graph Classes: A View Through Temporal Separators. CoRR Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
2018	B	`conf`	The Complexity of Finding Small Separators in Temporal Graphs. MFCS Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2018	B	`conf`	The Parameterized Complexity of Centrality Improvement in Networks. SOFSEM Clemens Hoffmann, Hendrik Molter, Manuel Sorge
2018	J	`jnl`	The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017	J	`jnl`	A Parameterized View on Multi-Layer Cluster Editing. CoRR Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2017	J	`jnl`	Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	C	`conf`	Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017	J	`jnl`	The Computational Complexity of Finding Separators in Temporal Graphs. CoRR Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier
2017	B	`conf`	The Minimum Shared Edges Problem on Grid-Like Graphs. WG Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
2017	J	`jnl`	The Minimum Shared Edges Problem on Grid-like Graphs. CoRR Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
2017	J	`jnl`	The Parameterized Complexity of Centrality Improvement in Networks. CoRR Clemens Hoffmann, Hendrik Molter, Manuel Sorge
2016	J	`jnl`	Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	J	`jnl`	Diminishable Parameterized Problems and Strict Polynomial Kernelization. CoRR Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier
2016	J	`jnl`	Enumerating Maximal Cliques in Temporal Graphs. CoRR Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	B	`conf`	Enumerating maximal cliques in temporal graphs. ASONAM Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2016	B	`conf`	Finding Secluded Places of Special Interest in Graphs. IPEC René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016	J	`jnl`	Finding Secluded Places of Special Interest in Graphs. CoRR René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
2016	J	`jnl`	Firefighting as a Strategic Game. Internet Math. Carme Àlvarez, Maria J. Blesa, Hendrik Molter
2016	A	`conf`	h-Index Manipulation by Undoing Merges. ECAI René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2016	J	`jnl`	h-Index Manipulation by Undoing Merges. CoRR René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh
2014	C	`conf`	Firefighting as a Game. WAW Carme Àlvarez, Maria J. Blesa, Hendrik Molter
2012	—	`conf`	ACO Beats EA on a Dynamic Pseudo-Boolean Function. PPSN (1) Timo Kötzing, Hendrik Molter