Clik here to view.
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks.
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev: Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS 2019: 57:1-57:15
View ArticleClik here to view.
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev: How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP...
View ArticleClik here to view.
The Temporal Explorer Who Returns to the Base.
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis: The Temporal Explorer Who Returns to the Base. CIAC 2019: 13-24
View ArticleClik here to view.
Sliding Window Temporal Graph Coloring.
George B. Mertzios, Hendrik Molter, Viktor Zamaraev: Sliding Window Temporal Graph Coloring. AAAI 2019: 7667-7674
View ArticleClik here to view.
Report on BCTCS & AlgoUK 2019.
Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma: Report on BCTCS & AlgoUK 2019. Bull. EATCS 128 (2019)
View ArticleClik here to view.
When Can Graph Hyperbolicity be Computed in Linear Time?
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon: When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81(5): 2016-2045 (2019)
View ArticleClik here to view.
Binary Search in Graphs Revisited.
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis: Binary Search in Graphs Revisited. Algorithmica 81(5): 1757-1780 (2019)
View ArticleClik here to view.
Temporal Network Optimization Subject to Connectivity Constraints.
George B. Mertzios, Othon Michail, Paul G. Spirakis: Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81(4): 1416-1449 (2019)
View ArticleClik here to view.
Equitable Scheduling on a Single Machine.
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay: Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020)
View ArticleClik here to view.
Matching in Stochastically Evolving Graphs.
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev: Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020)
View ArticleClik here to view.
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev: Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR abs/2004.06036 (2020)
View ArticleClik here to view.
Computing Maximum Matchings in Temporal Graphs.
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche: Computing Maximum Matchings in Temporal Graphs. STACS 2020: 27:1-27:14
View ArticleClik here to view.
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev: Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS 2020: 27:1-27:13
View ArticleClik here to view.
How fast can we reach a target vertex in stochastic temporal graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev: How fast can we reach a target vertex in stochastic temporal graphs? J....
View ArticleClik here to view.
Temporal vertex cover with a sliding time window.
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107: 108-123 (2020)
View ArticleClik here to view.
The Power of Linear-Time Data Reduction for Maximum Matching.
George B. Mertzios, André Nichterlein, Rolf Niedermeier: The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica 82(12): 3521-3565 (2020)
View ArticleClik here to view.
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171).
Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier: Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11(3): 16-46 (2021)
View ArticleClik here to view.
The Complexity of Growing a Graph.
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos: The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021)
View ArticleClik here to view.
Interference-free Walks in Time: Temporally Disjoint Paths.
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche: Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021)
View ArticleClik here to view.
The Complexity of Transitively Orienting Temporal Graphs.
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche: The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021)
View ArticleClik here to view.
Surveys in Combinatorics, 2021: Invited lectures from the 28th British...
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma: Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial...
View ArticleClik here to view.
The Complexity of Transitively Orienting Temporal Graphs.
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche: The Complexity of Transitively Orienting Temporal Graphs. MFCS 2021: 75:1-75:18
View ArticleClik here to view.
Interference-free Walks in Time: Temporally Disjoint Paths.
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche: Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021: 4090-4096
View ArticleClik here to view.
Preface.
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma: Preface. BCC 2021: vii-viii
View ArticleClik here to view.
Equitable Scheduling on a Single Machine.
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay: Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825
View ArticleClik here to view.
The temporal explorer who returns to the base.
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Christoforos L. Raptopoulos: The temporal explorer who returns to the base. J. Comput. Syst. Sci. 120: 179-193 (2021)
View ArticleClik here to view.
Sliding window temporal graph coloring.
George B. Mertzios, Hendrik Molter, Viktor Zamaraev: Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120: 97-115 (2021)
View ArticleClik here to view.
Deleting edges to restrict the size of an epidemic in temporal networks.
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev: Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119: 60-77 (2021)
View ArticleClik here to view.
The Complexity of Temporal Vertex Cover in Small-Degree Graphs.
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis: The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR abs/2204.04832 (2022)
View ArticleClik here to view.
The complexity of computing optimum labelings for temporal connectivity.
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis: The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022)
View ArticleClik here to view.
The Complexity of Computing Optimum Labelings for Temporal Connectivity.
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis: The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS 2022: 62:1-62:15
View ArticleClik here to view.
The Complexity of Growing a Graph.
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos: The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137
View ArticleClik here to view.
The Complexity of Temporal Vertex Cover in Small-Degree Graphs.
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis: The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI 2022: 10193-10201
View ArticleClik here to view.
Graphs with minimum fractional domatic number.
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev: Graphs with minimum fractional domatic number. CoRR abs/2302.11668 (2023)
View ArticleClik here to view.
Realizing temporal graphs from fastest travel times.
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis: Realizing temporal graphs from fastest travel times. CoRR abs/2302.08860 (2023)
View ArticleClik here to view.
Payment Scheduling in the Interval Debt Model.
Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan: Payment Scheduling in the Interval Debt Model. SOFSEM 2023: 267-282
View ArticleClik here to view.
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs...
Nina Klobas, George B. Mertzios, Paul G. Spirakis: Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). MFCS 2023: 5:1-5:12
View ArticleClik here to view.
Equitable scheduling on a single machine.
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay: Equitable scheduling on a single machine. J. Sched. 26(2): 209-225 (2023)
View ArticleClik here to view.
Computing maximum matchings in temporal graphs.
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche: Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023)
View ArticleClik here to view.
Interference-free walks in time: temporally disjoint paths.
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche: Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37(1): 1 (2023)
View ArticleClik here to view.
Graphs with minimum fractional domatic number.
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev: Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024)
View ArticleRealizing temporal transportation trees.
George B. Mertzios, Hendrik Molter, Paul G. Spirakis: Realizing temporal transportation trees. CoRR abs/2403.18513 (2024)
View ArticlePayment Scheduling in the Interval Debt Model.
Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan: Payment Scheduling in the Interval Debt Model. CoRR abs/2403.02198 (2024)
View ArticleFast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.
Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier: Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67(4): 70-79 (2024)
View ArticleOn the existence of δ-temporal cliques in random simple temporal graphs.
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis: On the existence of δ-temporal cliques in random simple temporal graphs. CoRR abs/2404.07147 (2024)
View ArticleBrief Announcement: On the Existence of δ-Temporal Cliques in Random Simple...
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis: Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. SAND 2024: 27:1-27:5
View ArticleTemporal Graph Realization from Fastest Paths.
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis: Temporal Graph Realization from Fastest Paths. SAND 2024: 16:1-16:18
View ArticleNP-Completeness of the Combinatorial Distance Matrix Realisation Problem.
David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff: NP-Completeness of the Combinatorial Distance Matrix Realisation Problem. CoRR abs/2406.14729 (2024)
View ArticleThe complexity of computing optimum labelings for temporal connectivity.
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis: The complexity of computing optimum labelings for temporal connectivity. J. Comput. Syst. Sci. 146: 103564 (2024)
View ArticleApproximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle.
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev: Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica 86(9): 2766-2785 (2024)
View Article