George B. Mertzios

According to our database1, George B. Mertzios authored at least 72 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Temporal vertex cover with a sliding time window.
J. Comput. Syst. Sci., 2020

2019
Report on BCTCS & AlgoUK 2019.
Bulletin of the EATCS, 2019

Linear Programming complementation and its application to fractional graph theory.
CoRR, 2019

Computing Maximum Matchings in Temporal Graphs.
CoRR, 2019

Temporal Network Optimization Subject to Connectivity Constraints.
Algorithmica, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?
Algorithmica, 2019

Binary Search in Graphs Revisited.
Algorithmica, 2019

Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

The Temporal Explorer Who Returns to the Base.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Sliding Window Temporal Graph Coloring.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.
SIAM J. Discrete Math., 2018

Strong bounds for evolution in networks.
J. Comput. Syst. Sci., 2018

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.
Discrete Optimization, 2018

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods.
CoRR, 2018

Searching for Maximum Out-Degree Vertices in Tournaments.
CoRR, 2018

Kernelization Lower Bounds for Finding Constant-Size Subgraphs.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Graph editing to a given degree sequence.
Theor. Comput. Sci., 2017

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs.
Theor. Comput. Sci., 2017

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Theor. Comput. Sci., 2017

Online Regenerator Placement.
Theory Comput. Syst., 2017

The Complexity of Optimal Design of Temporally Connected Graphs.
Theory Comput. Syst., 2017

Minimum bisection is NP-hard on unit disk graphs.
Inf. Comput., 2017

Determining majority in networks with local interactions and very small local memory.
Distributed Computing, 2017

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Algorithmica, 2017

The Power of Linear-Time Data Reduction for Maximum Matching.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

The Computational Complexity of Weighted Greedy Matching.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Multitolerance Graphs.
Encyclopedia of Algorithms, 2016

Approximating Fixation Probabilities in the Generalized Moran Process.
Encyclopedia of Algorithms, 2016

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.
SIAM J. Discrete Math., 2016

The Friendship Problem on Graphs.
Multiple-Valued Logic and Soft Computing, 2016

Ephemeral networks with random availability of links: The case of fast networks.
J. Parallel Distrib. Comput., 2016

On the intersection of tolerance and cocomparability graphs.
Discrete Applied Mathematics, 2016

Intersection graphs of L-shapes and segments in the plane.
Discrete Applied Mathematics, 2016

Fine-Grained Algorithm Design for Matching.
CoRR, 2016

On the Complexity of Weighted Greedy Matchings.
CoRR, 2016

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs.
Algorithmica, 2016

Stably Computing Order Statistics with Arithmetic Population Protocols.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Finding Secluded Places of Special Interest in Graphs.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Optimizing busy time on parallel machines.
Theor. Comput. Sci., 2015

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial.
SIAM J. Discrete Math., 2015

Designing and Testing Temporally Connected Graphs.
CoRR, 2015

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On Temporally Connected Graphs of Small Cost.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014
Parameterized Domination in Circle Graphs.
Theory Comput. Syst., 2014

Identification, location-domination and metric dimension on interval and permutation graphs.
CoRR, 2014

An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy.
Algorithmica, 2014

Approximating Fixation Probabilities in the Generalized Moran Process.
Algorithmica, 2014

Ephemeral networks with random availability of links: diameter and connectivity.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Natural models for evolution on networks.
Theor. Comput. Sci., 2013

On the Recognition of Four-Directional Orthogonal Ray Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Temporal Network Optimization Subject to Connectivity Constraints.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Placing regenerators in optical networks to satisfy multiple sets of requests.
IEEE/ACM Trans. Netw., 2012

The recognition of triangle graphs.
Theor. Comput. Sci., 2012

A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs.
SIAM J. Discrete Math., 2012

Strong Bounds for Evolution in Undirected Graphs
CoRR, 2012

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Easy
CoRR, 2012

Can Fixation be Guaranteed in the Generalized Moran Process?
CoRR, 2012

2011
The Recognition of Tolerance and Bounded Tolerance Graphs.
SIAM J. Comput., 2011

Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time.
Electronic Notes in Discrete Mathematics, 2011

Vertex splitting and the recognition of trapezoid graphs.
Discrete Applied Mathematics, 2011

The Longest Path Problem has a Polynomial Solution on Interval Graphs.
Algorithmica, 2011

2010
Window-games between TCP flows.
Theor. Comput. Sci., 2010

An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs.
Mathematics in Computer Science, 2010

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time.
Mathematics in Computer Science, 2010

2009
A New Intersection Model and Improved Algorithms for Tolerance Graphs.
SIAM J. Discrete Math., 2009

The Longest Path Problem Is Polynomial on Interval Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
A matrix characterization of interval and proper interval graphs.
Appl. Math. Lett., 2008

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2006
A polynomial algorithm for the k-cluster problem on the interval graphs.
Electronic Notes in Discrete Mathematics, 2006

2005
The k-Cluster Over the Interval Graphs Lies in P
CoRR, 2005

2004
A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines.
IEEE Trans. Instrumentation and Measurement, 2004


  Loading...