( en | de | ru )

 

Disambiguation of "Mertzios, George B."

Author of the publication

copydeleteadd this publication to your clipboard
How fast can we reach a target vertex in stochastic temporal graphs?

, , , , , and . J. Comput. Syst. Sci., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

George B Sumyk

George B Sumyk

B Klösgen

B Wiederanders

 

Other publications of authors with the same name

On the intersection of tolerance and cocomparability graphs., and . Discret. Appl. Math., (2016)Equitable Scheduling on a Single Machine., , , , , and . CoRR, (2020)Vertex splitting and the recognition of trapezoid graphs., and . Discret. Appl. Math., 159 (11): 1131-1147 (2011)Minimum Bisection Is NP-hard on Unit Disk Graphs., and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 251-262. Springer, (2014)Placing regenerators in optical networks to satisfy multiple sets of requests., , , and . IEEE/ACM Trans. Netw., 20 (6): 1870-1879 (2012)The recognition of triangle graphs.. Theor. Comput. Sci., (2012)The Power of Linear-Time Data Reduction for Maximum Matching., , and . Algorithmica, 82 (12): 3521-3565 (2020)The Friendship Problem on Graphs., and . J. Multiple Valued Log. Soft Comput., 27 (2-3): 275-285 (2016)New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs., and . SIAM J. Discret. Math., 30 (3): 1685-1725 (2016)How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?, , , , , and . ICALP, volume 132 of LIPIcs, page 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)