Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge B. Mertzios
Person information
- affiliation: Durham University, UK
- affiliation (former): University of Bordeaux/CNRS, France
- affiliation (former): University of Haifa, Israel
- affiliation (former): RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
:
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024)- [i50]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) - [i49]George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal transportation trees. CoRR abs/2403.18513 (2024) - 2023
- [j51]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) - [j50]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) - [j49]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) - [c50]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 - [c49]Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. SOFSEM 2023: 267-282 - [i48]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
Realizing temporal graphs from fastest travel times. CoRR abs/2302.08860 (2023) - [i47]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev:
Graphs with minimum fractional domatic number. CoRR abs/2302.11668 (2023) - 2022
- [c48]Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis:
The Complexity of Temporal Vertex Cover in Small-Degree Graphs. AAAI 2022: 10193-10201 - [c47]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. ALGOSENSORS 2022: 123-137 - [c46]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 - [i46]Nina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis:
The complexity of computing optimum labelings for temporal connectivity. CoRR abs/2202.05880 (2022) - [i45]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) - 2021
- [j48]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) - [j47]George B. Mertzios, Hendrik Molter, Viktor Zamaraev:
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120: 97-115 (2021) - [j46]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) - [c45]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. AAAI 2021: 11818-11825 - [c44]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii - [c43]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021: 4090-4096 - [c42]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 - [e1]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 Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents] - [i44]George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche:
The Complexity of Transitively Orienting Temporal Graphs. CoRR abs/2102.06783 (2021) - [i43]Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Interference-free Walks in Time: Temporally Disjoint Paths. CoRR abs/2105.08335 (2021) - [i42]George B. Mertzios, Othon Michail, George Skretas, Paul G. Spirakis, Michail Theofilatos:
The Complexity of Growing a Graph. CoRR abs/2107.14126 (2021) - [i41]Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier:
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11(3): 16-46 (2021) - 2020
- [j45]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica 82(12): 3521-3565 (2020) - [j44]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) - [j43]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: 65-83 (2020) - [c41]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 - [c40]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs. STACS 2020: 27:1-27:14 - [i40]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) - [i39]Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020) - [i38]Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Dvir Shabtay:
Equitable Scheduling on a Single Machine. CoRR abs/2010.04643 (2020)
2010 – 2019
- 2019
- [j42]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. Algorithmica 81(4): 1416-1449 (2019) - [j41]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. Algorithmica 81(5): 1757-1780 (2019) - [j40]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) - [j39]Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma:
Report on BCTCS & AlgoUK 2019. Bull. EATCS 128 (2019) - [c39]George B. Mertzios, Hendrik Molter, Viktor Zamaraev:
Sliding Window Temporal Graph Coloring. AAAI 2019: 7667-7674 - [c38]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The Temporal Explorer Who Returns to the Base. CIAC 2019: 13-24 - [c37]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: 131:1-131:14 - [c36]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 - [i37]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 abs/1903.03636 (2019) - [i36]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs. CoRR abs/1905.05304 (2019) - [i35]Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev:
Linear Programming complementation and its application to fractional graph theory. CoRR abs/1907.12775 (2019) - 2018
- [j38]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: 20-50 (2018) - [j37]George B. Mertzios, Paul G. Spirakis:
Strong bounds for evolution in networks. J. Comput. Syst. Sci. 97: 60-82 (2018) - [j36]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. 32(4): 2820-2835 (2018) - [c35]Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE 2018: 183-193 - [c34]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. ICALP 2018: 148:1-148:14 - [i34]Gregory Z. Gutin, George B. Mertzios, Felix Reidl:
Searching for Maximum Out-Degree Vertices in Tournaments. CoRR abs/1801.04702 (2018) - [i33]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. CoRR abs/1802.07103 (2018) - [i32]Gregory Z. Gutin, George B. Mertzios, Felix Reidl:
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods. CoRR abs/1805.01684 (2018) - [i31]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis:
The temporal explorer who returns to the base. CoRR abs/1805.04713 (2018) - [i30]Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev:
Deleting edges to restrict the size of an epidemic in temporal networks. CoRR abs/1805.06836 (2018) - [i29]George B. Mertzios, Hendrik Molter, Viktor Zamaraev:
Sliding Window Temporal Graph Coloring. CoRR abs/1811.04753 (2018) - 2017
- [j35]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): 914-944 (2017) - [j34]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): 1-16 (2017) - [j33]Josep Díaz, George B. Mertzios:
Minimum bisection is NP-hard on unit disk graphs. Inf. Comput. 256: 83-92 (2017) - [j32]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. Theory Comput. Syst. 61(3): 739-754 (2017) - [j31]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): 907-944 (2017) - [j30]Petr A. Golovach, George B. Mertzios:
Graph editing to a given degree sequence. Theor. Comput. Sci. 665: 1-12 (2017) - [j29]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: 43-58 (2017) - [j28]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: 67-95 (2017) - [c33]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
The Computational Complexity of Weighted Greedy Matching. AAAI 2017: 466-474 - [c32]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. MFCS 2017: 20:1-20:14 - [c31]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
The Power of Linear-Time Data Reduction for Maximum Matching. MFCS 2017: 46:1-46:14 - [c30]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS 2017: 397-408 - [i28]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When can Graph Hyperbolicity be computed in Linear Time? CoRR abs/1702.06503 (2017) - [i27]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
Binary Search in Graphs Revisited. CoRR abs/1702.08899 (2017) - [i26]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR abs/1703.05598 (2017) - [i25]Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR abs/1710.07601 (2017) - 2016
- [j27]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. Algorithmica 74(1): 385-414 (2016) - [j26]George B. Mertzios, Shmuel Zaks:
On the intersection of tolerance and cocomparability graphs. Discret. Appl. Math. 199: 46-88 (2016) - [j25]Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection graphs of L-shapes and segments in the plane. Discret. Appl. Math. 206: 48-55 (2016) - [j24]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: 109-120 (2016) - [j23]George B. Mertzios, Walter Unger:
The Friendship Problem on Graphs. J. Multiple Valued Log. Soft Comput. 27(2-3): 275-285 (2016) - [j22]Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. SIAM J. Discret. Math. 30(3): 1685-1725 (2016) - [c29]Petr A. Golovach, George B. Mertzios:
Graph Editing to a Given Degree Sequence. CSR 2016: 177-191 - [c28]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [c27]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Stably Computing Order Statistics with Arithmetic Population Protocols. MFCS 2016: 68:1-68:14 - [r2]George B. Mertzios:
Approximating Fixation Probabilities in the Generalized Moran Process. Encyclopedia of Algorithms 2016: 109-113 - [r1]George B. Mertzios:
Multitolerance Graphs. Encyclopedia of Algorithms 2016: 1386-1390 - [i24]Petr A. Golovach, George B. Mertzios:
Graph Editing to a Given Degree Sequence. CoRR abs/1601.03174 (2016) - [i23]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis:
On the Complexity of Weighted Greedy Matchings. CoRR abs/1602.05909 (2016) - [i22]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - [i21]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fine-Grained Algorithm Design for Matching. CoRR abs/1609.08879 (2016) - 2015
- [j21]George B. Mertzios:
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial. SIAM J. Discret. Math. 29(3): 1150-1185 (2015) - [j20]George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks:
Optimizing busy time on parallel machines. Theor. Comput. Sci. 562: 524-541 (2015) - [c26]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC 2015: 102-113 - [c25]Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. STACS 2015: 354-366 - [c24]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
On Temporally Connected Graphs of Small Cost. WAOA 2015: 84-96 - [c23]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: 456-471 - [i20]George B. Mertzios, Othon Michail, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. CoRR abs/1502.04382 (2015) - [i19]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Designing and Testing Temporally Connected Graphs. CoRR abs/1502.04579 (2015) - [i18]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR abs/1506.01652 (2015) - [i17]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 abs/1507.08164 (2015) - 2014
- [j19]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica 69(1): 78-91 (2014) - [j18]George B. Mertzios:
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. Algorithmica 69(3): 540-581 (2014) - [j17]George B. Mertzios, Ivona Bezáková:
Computing and counting longest paths on circular-arc graphs in polynomial time. Discret. Appl. Math. 164: 383-399 (2014) - [j16]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. Theory Comput. Syst. 54(1): 45-72 (2014) - [c22]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Determining Majority in Networks with Local Interactions and Very Small Local Memory. ICALP (1) 2014: 871-882 - [c21]Josep Díaz, George B. Mertzios:
Minimum Bisection Is NP-hard on Unit Disk Graphs. MFCS (2) 2014: 251-262 - [c20]Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection Graphs of L-Shapes and Segments in the Plane. MFCS (2) 2014: 299-310 - [c19]Eleni C. Akrida, Leszek Gasieniec, George B. Mertzios, Paul G. Spirakis:
Ephemeral networks with random availability of links: diameter and connectivity. SPAA 2014: 267-276 - [i16]Josep Díaz, George B. Mertzios:
Minimum Bisection is NP-hard on Unit Disk Graphs. CoRR abs/1404.0117 (2014) - [i15]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Determining Majority in Networks with Local Interactions and very Small Local Memory. CoRR abs/1404.7671 (2014) - [i14]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR abs/1405.2424 (2014) - [i13]Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. CoRR abs/1412.1543 (2014) - 2013
- [j15]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Natural models for evolution on networks. Theor. Comput. Sci. 477: 76-95 (2013) - [c18]George B. Mertzios:
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial. ESA 2013: 719-730 - [c17]George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. ICALP (2) 2013: 657-668 - [c16]George B. Mertzios, Paul G. Spirakis:
Strong Bounds for Evolution in Networks. ICALP (2) 2013: 669-680 - [c15]Stefan Felsner, George B. Mertzios, Irina Mustata:
On the Recognition of Four-Directional Orthogonal Ray Graphs. MFCS 2013: 373-384 - [c14]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. SOFSEM 2013: 332-343 - [i12]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. CoRR abs/1309.0195 (2013) - 2012
- [j14]George B. Mertzios, Derek G. Corneil:
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. SIAM J. Discret. Math. 26(3): 940-963 (2012) - [j13]George B. Mertzios:
The recognition of triangle graphs. Theor. Comput. Sci. 438: 34-47 (2012) - [j12]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Trans. Netw. 20(6): 1870-1879 (2012) - [c13]George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Shmuel Zaks:
Optimizing Busy Time on Parallel Machines. IPDPS 2012: 238-248 - [c12]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating fixation probabilities in the generalized Moran process. SODA 2012: 954-960 - [c11]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. WG 2012: 308-319 - [i11]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Can Fixation be Guaranteed in the Generalized Moran Process? CoRR abs/1202.0436 (2012) - [i10]George B. Mertzios, Paul G. Spirakis:
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs. CoRR abs/1202.4665 (2012) - [i9]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012) - [i8]George B. Mertzios, Shmuel Zaks:
On the Intersection of Tolerance and Cocomparability Graphs. CoRR abs/1207.0552 (2012) - [i7]George B. Mertzios:
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Easy. CoRR abs/1210.4352 (2012) - [i6]George B. Mertzios, Paul G. Spirakis:
Strong Bounds for Evolution in Undirected Graphs. CoRR abs/1211.2384 (2012) - 2011
- [j11]Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos:
The Longest Path Problem has a Polynomial Solution on Interval Graphs. Algorithmica 61(2): 320-341 (2011) - [j10]George B. Mertzios, Derek G. Corneil:
Vertex splitting and the recognition of trapezoid graphs. Discret. Appl. Math. 159(11): 1131-1147 (2011) - [j9]George B. Mertzios, Ivona Bezáková:
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time. Electron. Notes Discret. Math. 37: 219-224 (2011) - [j8]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. SIAM J. Comput. 40(5): 1234-1257 (2011) - [c10]George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
Online Regenerator Placement. OPODIS 2011: 4-17 - [c9]George B. Mertzios:
An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy. SODA 2011: 1306-1317 - [c8]George B. Mertzios:
The Recognition of Triangle Graphs. STACS 2011: 591-602 - [c7]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Natural Models for Evolution on Networks. WINE 2011: 290-301 - [i5]George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Natural Models for Evolution on Networks. CoRR abs/1102.3426 (2011) - [i4]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. CoRR abs/1111.3321 (2011) - 2010
- [j7]George B. Mertzios, Walter Unger:
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. Math. Comput. Sci. 3(1): 73-84 (2010) - [j6]George B. Mertzios, Walter Unger:
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs. Math. Comput. Sci. 3(1): 85-96 (2010) - [j5]Pavlos S. Efraimidis, Lazaros Tsavlidis, George B. Mertzios:
Window-games between TCP flows. Theor. Comput. Sci. 411(31-33): 2798-2817 (2010) - [c6]George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. ICALP (2) 2010: 333-344 - [c5]George B. Mertzios, Shmuel Zaks:
On the Intersection of Tolerance and Cocomparability Graphs. ISAAC (1) 2010: 230-240 - [c4]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. STACS 2010: 585-596 - [i3]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
The Recognition of Tolerance and Bounded Tolerance Graphs. CoRR abs/1001.3251 (2010) - [i2]George B. Mertzios, Derek G. Corneil:
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs. CoRR abs/1004.4560 (2010)
2000 – 2009
- 2009
- [j4]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM J. Discret. Math. 23(4): 1800-1813 (2009) - [c3]Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos:
The Longest Path Problem Is Polynomial on Interval Graphs. MFCS 2009: 403-414 - [c2]George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295 - 2008
- [j3]George B. Mertzios:
A matrix characterization of interval and proper interval graphs. Appl. Math. Lett. 21(4): 332-337 (2008) - [c1]George B. Mertzios, Walter Unger:
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. IWOCA 2008: 197-211 - 2006
- [j2]George B. Mertzios:
A polynomial algorithm for the k-cluster problem on the interval graphs. Electron. Notes Discret. Math. 26: 111-118 (2006) - 2005
- [i1]George B. Mertzios:
The k-Cluster Over the Interval Graphs Lies in P. CoRR abs/cs/0512046 (2005) - 2004
- [j1]George C. Giakos, Luay Fraiwan, N. Patnekar, S. Sumrain, George B. Mertzios, S. Periyathamby:
A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines. IEEE Trans. Instrum. Meas. 53(1): 216-222 (2004)
Coauthor Index
[i49] [c50] [i48] [c48] [c47] [c46] [i46] [i45] [j46] [c42] [i44] [i42] [j44] [j43] [c41] [i40] [i39] [j42] [j41] [c38] [c37] [i37] [j37] [c34] [i33] [i31] [j34] [j31] [c33] [c32] [i27] [j27] [j24] [c27] [i23] [c24] [i20] [i19] [j19] [c22] [c19] [i15] [j15] [c17] [c16] [c14] [c12] [i11] [i10] [i6] [c7] [i5] [i4]
Victor Zamaraev
aka: Viktor Zamaraev
aka: Viktor Zamaraev
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
