George B. Mertzios

179 papers A* 10A 7B 23C 4Misc 1Journal 117Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Round-delayed amnesiac flooding. Theor. Comput. Sci. Oluwatobi Alafin, George B. Mertzios, Paul G. Spirakis
2026	J	`jnl`	Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs. CoRR Henry Austin, George B. Mertzios, Paul G. Spirakis
2025	A	`conf`	Amnesiac Flooding: Easy to Break, Hard to Escape. DISC Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan
2025	J	`jnl`	Amnesiac Flooding: Easy to break, hard to escape. CoRR Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan
2025	A*	`conf`	Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. PODC Henry Austin, Maximilien Gadouleau, George B. Mertzios, Amitabh Trehan
2025	—	`conf`	Computational Complexity of Combinatorial Distance Matrix Realisation. CIAC (1) David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff
2025	J	`jnl`	Linear Programming complementation. Theor. Comput. Sci. Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
2025	J	`jnl`	Maintaining Bipartite Colourings on Temporal Graphs on a Budget. CoRR Duncan Adamson, George B. Mertzios, Paul G. Spirakis
2025	J	`jnl`	Payment scheduling in the Interval Debt Model. Theor. Comput. Sci. Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
2025	B	`conf`	Realizing Temporal Transportation Trees. WG George B. Mertzios, Hendrik Molter, Nils Morawietz, Paul G. Spirakis
2025	—	`conf`	Round-Asynchronous Amnesiac Flooding. ALGOWIN Oluwatobi Alafin, George B. Mertzios, 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 growing a graph. J. Comput. Syst. Sci. George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
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
2024	J	`jnl`	Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2024	—	`conf`	Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. SAND George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2024	J	`jnl`	Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
2024	J	`jnl`	Graphs with minimum fractional domatic number. Discret. Appl. Math. Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
2024	J	`jnl`	NP-Completeness of the Combinatorial Distance Matrix Realisation Problem. CoRR David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff
2024	J	`jnl`	On the existence of δ-temporal cliques in random simple temporal graphs. CoRR George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2024	J	`jnl`	Payment Scheduling in the Interval Debt Model. CoRR Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
2024	J	`jnl`	Realizing temporal transportation trees. CoRR George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2024	—	`conf`	Temporal Graph Realization from Fastest Paths. SAND Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2024	—	`conf`	The Threshold of Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. ALGOWIN George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
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	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`	Graphs with minimum fractional domatic number. CoRR Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
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	B	`conf`	Payment Scheduling in the Interval Debt Model. SOFSEM Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan
2023	J	`jnl`	Realizing temporal graphs from fastest travel times. CoRR Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2023	B	`conf`	Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk). MFCS Nina Klobas, George B. Mertzios, Paul G. Spirakis
2022	B	`conf`	The Complexity of Computing Optimum Labelings for Temporal Connectivity. MFCS Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis
2022	C	`conf`	The Complexity of Growing a Graph. ALGOSENSORS George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
2022	A*	`conf`	The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
2022	J	`jnl`	The Complexity of Temporal Vertex Cover in Small-Degree Graphs. CoRR Thekla Hamm, Nina Klobas, George B. Mertzios, 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
2021	J	`jnl`	Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
2021	A*	`conf`	Equitable Scheduling on a Single Machine. AAAI Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay
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	—	`conf`	Preface. BCC Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
2021	J	`jnl`	Sliding window temporal graph coloring. J. Comput. Syst. Sci. George B. Mertzios, Hendrik Molter, Viktor Zamaraev
2021	—	`ed.`	Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. BCC Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
2021	J	`jnl`	Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
2021	J	`jnl`	The Complexity of Growing a Graph. CoRR George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos
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	J	`jnl`	The temporal explorer who returns to the base. J. Comput. Syst. Sci. Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Christoforos L. Raptopoulos
2020	A	`conf`	Computing Maximum Matchings in Temporal Graphs. STACS George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
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`	Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Matching in Stochastically Evolving Graphs. CoRR Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2020	J	`jnl`	The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica George B. Mertzios, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Binary Search in Graphs Revisited. Algorithmica Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2019	J	`jnl`	Computing Maximum Matchings in Temporal Graphs. CoRR George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
2019	B	`conf`	Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
2019	A*	`conf`	How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2019	J	`jnl`	How fast can we reach a target vertex in stochastic temporal graphs? CoRR Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
2019	J	`jnl`	Linear Programming complementation and its application to fractional graph theory. CoRR Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
2019	J	`jnl`	Report on BCTCS & AlgoUK 2019. Bull. EATCS Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma
2019	A*	`conf`	Sliding Window Temporal Graph Coloring. AAAI George B. Mertzios, Hendrik Molter, Viktor Zamaraev
2019	J	`jnl`	Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica George B. Mertzios, Othon Michail, Paul G. Spirakis
2019	C	`conf`	The Temporal Explorer Who Returns to the Base. CIAC Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
2019	J	`jnl`	When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2018	J	`jnl`	A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. George B. Mertzios, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Deleting edges to restrict the size of an epidemic in temporal networks. CoRR Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
2018	C	`conf`	Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE Till Fluschnik, George B. Mertzios, André Nichterlein
2018	J	`jnl`	Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR Gregory Z. Gutin, George B. Mertzios, Felix Reidl
2018	J	`jnl`	Searching for Maximum Out-Degree Vertices in Tournaments. CoRR Gregory Z. Gutin, George B. Mertzios, Felix Reidl
2018	J	`jnl`	Sliding Window Temporal Graph Coloring. CoRR George B. Mertzios, Hendrik Molter, Viktor Zamaraev
2018	J	`jnl`	Strong bounds for evolution in networks. J. Comput. Syst. Sci. George B. Mertzios, Paul G. Spirakis
2018	A*	`conf`	Temporal Vertex Cover with a Sliding Time Window. ICALP Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
2018	J	`jnl`	Temporal Vertex Cover with a Sliding Time Window. CoRR Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
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ý
2018	J	`jnl`	The temporal explorer who returns to the base. CoRR Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis
2017	B	`conf`	Binary Search in Graphs Revisited. MFCS Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2017	J	`jnl`	Binary Search in Graphs Revisited. CoRR Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2017	J	`jnl`	Determining majority in networks with local interactions and very small local memory. Distributed Comput. George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2017	J	`jnl`	Graph editing to a given degree sequence. Theor. Comput. Sci. Petr A. Golovach, George B. Mertzios
2017	J	`jnl`	Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017	J	`jnl`	Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR Till Fluschnik, George B. Mertzios, André Nichterlein
2017	J	`jnl`	Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR George B. Mertzios, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Minimum bisection is NP-hard on unit disk graphs. Inf. Comput. Josep Díaz, George B. Mertzios
2017	J	`jnl`	Online Regenerator Placement. Theory Comput. Syst. George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2017	J	`jnl`	Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2017	J	`jnl`	The Complexity of Optimal Design of Temporally Connected Graphs. Theory Comput. Syst. Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2017	A*	`conf`	The Computational Complexity of Weighted Greedy Matching. AAAI Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2017	B	`conf`	The Power of Linear-Time Data Reduction for Maximum Matching. MFCS George B. Mertzios, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	When Can Graph Hyperbolicity Be Computed in Linear Time? WADS Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2017	J	`jnl`	When can Graph Hyperbolicity be computed in Linear Time? CoRR Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2016	J	`jnl`	Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. Algorithmica George B. Mertzios, Paul G. Spirakis
2016	—	`ch.`	Approximating Fixation Probabilities in the Generalized Moran Process. Encyclopedia of Algorithms George B. Mertzios
2016	J	`jnl`	Ephemeral networks with random availability of links: The case of fast networks. J. Parallel Distributed Comput. Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
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`	Fine-Grained Algorithm Design for Matching. CoRR George B. Mertzios, André Nichterlein, Rolf Niedermeier
2016	Misc	`conf`	Graph Editing to a Given Degree Sequence. CSR Petr A. Golovach, George B. Mertzios
2016	J	`jnl`	Graph Editing to a Given Degree Sequence. CoRR Petr A. Golovach, George B. Mertzios
2016	J	`jnl`	Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt
2016	—	`ch.`	Multitolerance Graphs. Encyclopedia of Algorithms George B. Mertzios
2016	J	`jnl`	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. SIAM J. Discret. Math. Archontia C. Giannopoulou, George B. Mertzios
2016	J	`jnl`	On the Complexity of Weighted Greedy Matchings. CoRR Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
2016	J	`jnl`	On the intersection of tolerance and cocomparability graphs. Discret. Appl. Math. George B. Mertzios, Shmuel Zaks
2016	B	`conf`	Stably Computing Order Statistics with Arithmetic Population Protocols. MFCS George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2016	J	`jnl`	The Friendship Problem on Graphs. J. Multiple Valued Log. Soft Comput. George B. Mertzios, Walter Unger
2015	B	`conf`	Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015	J	`jnl`	Designing and Testing Temporally Connected Graphs. CoRR Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2015	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015	A	`conf`	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. STACS Archontia C. Giannopoulou, George B. Mertzios
2015	B	`conf`	On Temporally Connected Graphs of Small Cost. WAOA Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2015	J	`jnl`	Optimizing busy time on parallel machines. Theor. Comput. Sci. George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
2015	J	`jnl`	Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2015	B	`conf`	Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2015	J	`jnl`	Temporal Network Optimization Subject to Connectivity Constraints. CoRR George B. Mertzios, Othon Michail, Paul G. Spirakis
2015	J	`jnl`	The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial. SIAM J. Discret. Math. George B. Mertzios
2014	J	`jnl`	An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. Algorithmica George B. Mertzios
2014	J	`jnl`	Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2014	J	`jnl`	Computing and counting longest paths on circular-arc graphs in polynomial time. Discret. Appl. Math. George B. Mertzios, Ivona Bezáková
2014	—	`conf`	Determining Majority in Networks with Local Interactions and Very Small Local Memory. ICALP (1) George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2014	J	`jnl`	Determining Majority in Networks with Local Interactions and very Small Local Memory. CoRR George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2014	B	`conf`	Ephemeral networks with random availability of links: diameter and connectivity. SPAA Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis
2014	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. CoRR Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2014	—	`conf`	Intersection Graphs of L-Shapes and Segments in the Plane. MFCS (2) Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt
2014	—	`conf`	Minimum Bisection Is NP-hard on Unit Disk Graphs. MFCS (2) Josep Díaz, George B. Mertzios
2014	J	`jnl`	Minimum Bisection is NP-hard on Unit Disk Graphs. CoRR Josep Díaz, George B. Mertzios
2014	J	`jnl`	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. CoRR Archontia C. Giannopoulou, George B. Mertzios
2014	J	`jnl`	Parameterized Domination in Circle Graphs. Theory Comput. Syst. Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2013	B	`conf`	Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. SOFSEM George B. Mertzios, Paul G. Spirakis
2013	J	`jnl`	Natural models for evolution on networks. Theor. Comput. Sci. George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2013	B	`conf`	On the Recognition of Four-Directional Orthogonal Ray Graphs. MFCS Stefan Felsner, George B. Mertzios, Irina Mustata
2013	J	`jnl`	Online Regenerator Placement. CoRR George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2013	—	`conf`	Strong Bounds for Evolution in Networks. ICALP (2) George B. Mertzios, Paul G. Spirakis
2013	—	`conf`	Temporal Network Optimization Subject to Connectivity Constraints. ICALP (2) George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
2013	A	`conf`	The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial. ESA George B. Mertzios
2012	J	`jnl`	A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. SIAM J. Discret. Math. George B. Mertzios, Derek G. Corneil
2012	J	`jnl`	Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs CoRR George B. Mertzios, Paul G. Spirakis
2012	A*	`conf`	Approximating fixation probabilities in the generalized Moran process. SODA Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2012	J	`jnl`	Can Fixation be Guaranteed in the Generalized Moran Process? CoRR Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2012	J	`jnl`	On the Intersection of Tolerance and Cocomparability Graphs CoRR George B. Mertzios, Shmuel Zaks
2012	A	`conf`	Optimizing Busy Time on Parallel Machines. IPDPS George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks
2012	J	`jnl`	Parameterized Domination in Circle Graphs CoRR Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	B	`conf`	Parameterized Domination in Circle Graphs. WG Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012	J	`jnl`	Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2012	J	`jnl`	Strong Bounds for Evolution in Undirected Graphs CoRR George B. Mertzios, Paul G. Spirakis
2012	J	`jnl`	The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Easy CoRR George B. Mertzios
2012	J	`jnl`	The recognition of triangle graphs. Theor. Comput. Sci. George B. Mertzios
2011	A*	`conf`	An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. SODA George B. Mertzios
2011	J	`jnl`	Approximating Fixation Probabilities in the Generalized Moran Process CoRR Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis
2011	J	`jnl`	Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. Electron. Notes Discret. Math. George B. Mertzios, Ivona Bezáková
2011	J	`jnl`	Natural Models for Evolution on Networks CoRR George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2011	—	`conf`	Natural Models for Evolution on Networks. WINE George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2011	B	`conf`	Online Regenerator Placement. OPODIS George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2011	J	`jnl`	The Longest Path Problem has a Polynomial Solution on Interval Graphs. Algorithmica Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
2011	J	`jnl`	The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. George B. Mertzios, Ignasi Sau, Shmuel Zaks
2011	A	`conf`	The Recognition of Triangle Graphs. STACS George B. Mertzios
2011	J	`jnl`	Vertex splitting and the recognition of trapezoid graphs. Discret. Appl. Math. George B. Mertzios, Derek G. Corneil
2010	J	`jnl`	A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs CoRR George B. Mertzios, Derek G. Corneil
2010	J	`jnl`	An Optimal Algorithm for the Math. Comput. Sci. George B. Mertzios, Walter Unger
2010	—	`conf`	On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) George B. Mertzios, Shmuel Zaks
2010	—	`conf`	Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
2010	J	`jnl`	Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. Math. Comput. Sci. George B. Mertzios, Walter Unger
2010	J	`jnl`	The Recognition of Tolerance and Bounded Tolerance Graphs CoRR George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010	A	`conf`	The Recognition of Tolerance and Bounded Tolerance Graphs. STACS George B. Mertzios, Ignasi Sau, Shmuel Zaks
2010	J	`jnl`	Window-games between TCP flows. Theor. Comput. Sci. Pavlos S. Efraimidis, Lazaros Tsavlidis, George B. Mertzios
2009	B	`conf`	A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG George B. Mertzios, Ignasi Sau, Shmuel Zaks
2009	J	`jnl`	A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discret. Math. George B. Mertzios, Ignasi Sau, Shmuel Zaks
2009	B	`conf`	The Longest Path Problem Is Polynomial on Interval Graphs. MFCS Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
2008	J	`jnl`	A matrix characterization of interval and proper interval graphs. Appl. Math. Lett. George B. Mertzios
2008	C	`conf`	An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. IWOCA George B. Mertzios, Walter Unger
2006	J	`jnl`	A polynomial algorithm for the k-cluster problem on the interval graphs. Electron. Notes Discret. Math. George B. Mertzios
2005	J	`jnl`	The k-Cluster Over the Interval Graphs Lies in P CoRR George B. Mertzios
2004	J	`jnl`	A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines. IEEE Trans. Instrum. Meas. George C. Giakos, Luay Fraiwan, N. Patnekar, S. Sumrain, George B. Mertzios, S. Periyathamby