George B. Mertzios
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
53
Venues
21
Active years
2008–2026
Best venue rank
A*
Where they publish
Papers
53 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | MFCS | Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs. | Henry Austin, George B. Mertzios, Paul G. Spirakis |
| 2026 | SIROCCO | Maintaining Bipartite Colourings on Temporal Graphs on a Budget. | Duncan Adamson, George B. Mertzios, Paul G. Spirakis |
| 2025 | Algosensors | Round-Asynchronous Amnesiac Flooding. | Oluwatobi Alafin, George B. Mertzios, Paul G. Spirakis |
| 2025 | CIAC | Computational Complexity of Combinatorial Distance Matrix Realisation. | David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff |
| 2025 | MFCS | Temporal Graph Realization with Bounded Stretch. | George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis |
| 2025 | PODC | Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. | Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan |
| 2025 | WG | Realizing Temporal Transportation Trees. | George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis |
| 2024 | Algosensors | The Threshold of Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. | George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2023 | MFCS | Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). | Nina Klobas, George B. Mertzios, Paul G. Spirakis |
| 2023 | SOFSEM | Payment Scheduling in the Interval Debt Model. | Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan |
| 2022 | AAAI | The Complexity of Temporal Vertex Cover in Small-Degree Graphs. | Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis |
| 2022 | Algosensors | The Complexity of Growing a Graph. | George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos |
| 2022 | MFCS | The Complexity of Computing Optimum Labelings for Temporal Connectivity. | Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis |
| 2021 | AAAI | Equitable Scheduling on a Single Machine. | Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay |
| 2021 | IJCAI | Interference-free Walks in Time: Temporally Disjoint Paths. | Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche |
| 2021 | MFCS | The Complexity of Transitively Orienting Temporal Graphs. | George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche |
| 2020 | MFCS | Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev |
| 2020 | STACS | Computing Maximum Matchings in Temporal Graphs. | George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche |
| 2019 | AAAI | Sliding Window Temporal Graph Coloring. | George B. Mertzios, Hendrik Molter, Viktor Zamaraev |
| 2019 | CIAC | The Temporal Explorer Who Returns to the Base. | Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis |
| 2019 | ICALP | 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 |
| 2019 | MFCS | Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. | Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev |
| 2018 | CiE | Kernelization Lower Bounds for Finding Constant-Size Subgraphs. | Till Fluschnik, George B. Mertzios, Andr Nichterlein |
| 2018 | ICALP | Temporal Vertex Cover with a Sliding Time Window. | Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev |
| 2017 | AAAI | The Computational Complexity of Weighted Greedy Matching. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
| 2017 | MFCS | Binary Search in Graphs Revisited. | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis |
| 2017 | MFCS | The Power of Linear-Time Data Reduction for Maximum Matching. | George B. Mertzios, Andr Nichterlein, Rolf Niedermeier |
| 2017 | WADS | When Can Graph Hyperbolicity Be Computed in Linear Time? | Till Fluschnik, Christian Komusiewicz, George B. Mertzios, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2016 | CSR | Graph Editing to a Given Degree Sequence. | Petr A. Golovach, George B. Mertzios |
| 2016 | MFCS | Stably Computing Order Statistics with Arithmetic Population Protocols. | George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2015 | STACS | New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. | Archontia C. Giannopoulou, George B. Mertzios |
| 2015 | WAOA | On Temporally Connected Graphs of Small Cost. | Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis |
| 2015 | WG | Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. | Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov |
| 2014 | ICALP | Determining Majority in Networks with Local Interactions and Very Small Local Memory. | George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2014 | MFCS | Minimum Bisection Is NP-hard on Unit Disk Graphs. | Josep Daz, George B. Mertzios |
| 2014 | MFCS | Intersection Graphs of L-Shapes and Segments in the Plane. | Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt |
| 2014 | SPAA | Ephemeral networks with random availability of links: diameter and connectivity. | Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis |
| 2013 | ESA | The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial. | George B. Mertzios |
| 2013 | ICALP | Temporal Network Optimization Subject to Connectivity Constraints. | George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis |
| 2013 | ICALP | Strong Bounds for Evolution in Networks. | George B. Mertzios, Paul G. Spirakis |
| 2013 | MFCS | On the Recognition of Four-Directional Orthogonal Ray Graphs. | Stefan Felsner, George B. Mertzios, Irina Mustata |
| 2013 | SOFSEM | Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. | George B. Mertzios, Paul G. Spirakis |
| 2012 | SODA | Approximating fixation probabilities in the generalized Moran process. | Josep Daz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis |
| 2012 | WG | Parameterized Domination in Circle Graphs. | Nicolas Bousquet, Daniel Gonalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stphan Thomass |
| 2011 | OPODIS | Online Regenerator Placement. | George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
| 2011 | SODA | An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. | George B. Mertzios |
| 2011 | STACS | The Recognition of Triangle Graphs. | George B. Mertzios |
| 2010 | ICALP | Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. | George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks |
| 2010 | ISAAC | On the Intersection of Tolerance and Cocomparability Graphs. | George B. Mertzios, Shmuel Zaks |
| 2010 | STACS | The Recognition of Tolerance and Bounded Tolerance Graphs. | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
| 2009 | MFCS | The Longest Path Problem Is Polynomial on Interval Graphs. | Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos |
| 2009 | WG | A New Intersection Model and Improved Algorithms for Tolerance Graphs. | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
| 2008 | IWOCA | An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. | George B. Mertzios, Walter Unger |