George B. Mertzios

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 91

Top Venues

CoRR

J. Comput. Syst. Sci.

MFCS

Algorithmica

Publications

David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff
NP-Completeness of the Combinatorial Distance Matrix Realisation Problem. CoRR (2024)
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)
Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
Payment Scheduling in the Interval Debt Model. CoRR (2024)
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343 (2024)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Temporal Graph Realization from Fastest Paths. SAND (2024)
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
On the existence of δ-temporal cliques in random simple temporal graphs. CoRR (2024)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
The complexity of computing optimum labelings for temporal connectivity. J. Comput. Syst. Sci. 146 (2024)
George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Realizing temporal transportation trees. CoRR (2024)
Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67 (4) (2024)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
Realizing temporal graphs from fastest travel times. CoRR (2023)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable scheduling on a single machine. J. Sched. 26 (2) (2023)
Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
Payment Scheduling in the Interval Debt Model. SOFSEM (2023)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137 (2023)
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
Graphs with minimum fractional domatic number. CoRR (2023)
Nina Klobas, George B. Mertzios, Paul G. Spirakis
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). MFCS (2023)
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) (2023)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS (2022)
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
The Complexity of Growing a Graph. ALGOSENSORS (2022)
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI (2022)
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR (2022)
Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
The complexity of computing optimum labelings for temporal connectivity. CoRR (2022)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
The Complexity of Transitively Orienting Temporal Graphs. CoRR (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR (2021)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120 (2021)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. AAAI (2021)
George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
The Complexity of Growing a Graph. CoRR (2021)
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 (2021)
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 (2021)
Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11 (3) (2021)
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
Preface. BCC (2021)
George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche
The Complexity of Transitively Orienting Temporal Graphs. MFCS (2021)
Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI (2021)
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Matching in Stochastically Evolving Graphs. CoRR (2020)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107 (2020)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR (2020)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS (2020)
Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
Equitable Scheduling on a Single Machine. CoRR (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. STACS (2020)
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. Comput. Syst. Sci. 114 (2020)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica 82 (12) (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. CoRR (2019)
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? CoRR (2019)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Binary Search in Graphs Revisited. Algorithmica 81 (5) (2019)
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 (2019)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS (2019)
George B. Mertzios, Othon Michail, Paul G. Spirakis
Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81 (4) (2019)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. AAAI (2019)
Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma
Report on BCTCS & AlgoUK 2019. Bull. EATCS 128 (2019)
Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
Linear Programming complementation and its application to fractional graph theory. CoRR (2019)
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) (2019)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
The Temporal Explorer Who Returns to the Base. CIAC (2019)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
The temporal explorer who returns to the base. CoRR (2018)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal Vertex Cover with a Sliding Time Window. ICALP (2018)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30 (2018)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. CoRR (2018)
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE (2018)
George B. Mertzios, Paul G. Spirakis
Strong bounds for evolution in networks. J. Comput. Syst. Sci. 97 (2018)
Gregory Z. Gutin, George B. Mertzios, Felix Reidl
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR (2018)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal Vertex Cover with a Sliding Time Window. CoRR (2018)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Gregory Z. Gutin, George B. Mertzios, Felix Reidl
Searching for Maximum Out-Degree Vertices in Tournaments. CoRR (2018)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting edges to restrict the size of an epidemic in temporal networks. CoRR (2018)
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. 689 (2017)
Till Fluschnik, George B. Mertzios, André Nichterlein
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR (2017)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. 668 (2017)
Josep Díaz, George B. Mertzios
Minimum bisection is NP-hard on unit disk graphs. Inf. Comput. 256 (2017)
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
Determining majority in networks with local interactions and very small local memory. Distributed Comput. 30 (1) (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When can Graph Hyperbolicity be computed in Linear Time? CoRR (2017)
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
The Computational Complexity of Weighted Greedy Matching. AAAI (2017)
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Online Regenerator Placement. Theory Comput. Syst. 61 (3) (2017)
Petr A. Golovach, George B. Mertzios
Graph editing to a given degree sequence. Theor. Comput. Sci. 665 (2017)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica 78 (3) (2017)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
The Power of Linear-Time Data Reduction for Maximum Matching. MFCS (2017)
Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst. 61 (3) (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Binary Search in Graphs Revisited. MFCS (2017)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Binary Search in Graphs Revisited. CoRR (2017)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR (2017)
Petr A. Golovach, George B. Mertzios
Graph Editing to a Given Degree Sequence. CSR (2016)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
On the Complexity of Weighted Greedy Matchings. CoRR (2016)
George B. Mertzios, Walter Unger
The Friendship Problem on Graphs. J. Multiple Valued Log. Soft Comput. 27 (2-3) (2016)
George B. Mertzios, André Nichterlein, Rolf Niedermeier
Fine-Grained Algorithm Design for Matching. CoRR (2016)
Archontia C. Giannopoulou, George B. Mertzios
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. SIAM J. Discret. Math. 30 (3) (2016)
Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt
Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206 (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. CoRR (2016)
Petr A. Golovach, George B. Mertzios
Graph Editing to a Given Degree Sequence. CoRR (2016)
Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distributed Comput. 87 (2016)
George B. Mertzios, Shmuel Zaks
On the intersection of tolerance and cocomparability graphs. Discret. Appl. Math. 199 (2016)
René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. IPEC (2016)
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
Stably Computing Order Statistics with Arithmetic Population Protocols. MFCS (2016)
George B. Mertzios, Paul G. Spirakis
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. Algorithmica 74 (1) (2016)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG (2015)
Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
Designing and Testing Temporally Connected Graphs. CoRR (2015)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR (2015)
George B. Mertzios
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial. SIAM J. Discret. Math. 29 (3) (2015)
Archontia C. Giannopoulou, George B. Mertzios
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. STACS (2015)
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR (2015)
George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
Optimizing busy time on parallel machines. Theor. Comput. Sci. 562 (2015)
George B. Mertzios, Othon Michail, Paul G. Spirakis
Temporal Network Optimization Subject to Connectivity Constraints. CoRR (2015)
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC (2015)

George B. Mertzios.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

George B. Mertzios