George B. Mertzios

Norbert Peyerimhoff

CoRR, 2024

On the existence of δ-temporal cliques in random simple temporal graphs.

[BibT_eX]

[DOI]

CoRR, 2024

Realizing temporal transportation trees.

[BibT_eX]

[DOI]

Hendrik Molter

CoRR, 2024

Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Temporal Graph Realization from Fastest Paths.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

2023

Computing maximum matchings in temporal graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

Equitable scheduling on a single machine.

[BibT_eX]

[DOI]

J. Sched., 2023

Realizing temporal graphs from fastest travel times.

[BibT_eX]

[DOI]

CoRR, 2023

Interference-free walks in time: temporally disjoint paths.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2023

Payment Scheduling in the Interval Debt Model.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk).

[BibT_eX]

[DOI]

Nina Klobas

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

The Complexity of Temporal Vertex Cover in Small-Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Sliding window temporal graph coloring.

[BibT_eX]

[DOI]

Hendrik Molter

Viktor Zamaraev

J. Comput. Syst. Sci., 2021

Deleting edges to restrict the size of an epidemic in temporal networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

The temporal explorer who returns to the base.

[BibT_eX]

[DOI]

Eleni C. Akrida

J. Comput. Syst. Sci., 2021

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

The Complexity of Transitively Orienting Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Preface.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2021

2020

Temporal vertex cover with a sliding time window.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

How fast can we reach a target vertex in stochastic temporal graphs?

[BibT_eX]

[DOI]

Eleni C. Akrida

Viktor Zamaraev

J. Comput. Syst. Sci., 2020

Matching in Stochastically Evolving Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

The Power of Linear-Time Data Reduction for Maximum Matching.

[BibT_eX]

[DOI]

Algorithmica, 2020

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Report on BCTCS & AlgoUK 2019.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Linear Programming complementation and its application to fractional graph theory.

[BibT_eX]

[DOI]

Maximilien Gadouleau

Viktor Zamaraev

CoRR, 2019

Temporal Network Optimization Subject to Connectivity Constraints.

[BibT_eX]

[DOI]

Othon Michail

Algorithmica, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?

[BibT_eX]

[DOI]

Till Fluschnik

Christian Komusiewicz

Algorithmica, 2019

Binary Search in Graphs Revisited.

[BibT_eX]

[DOI]

Argyrios Deligkas

Algorithmica, 2019

The Temporal Explorer Who Returns to the Base.

[BibT_eX]

[DOI]

Eleni C. Akrida

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Strong bounds for evolution in networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2018

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

[BibT_eX]

[DOI]

Gregory Z. Gutin

Felix Reidl

CoRR, 2018

Searching for Maximum Out-Degree Vertices in Tournaments.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Felix Reidl

CoRR, 2018

Kernelization Lower Bounds for Finding Constant-Size Subgraphs.

[BibT_eX]

[DOI]

Till Fluschnik

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Graph editing to a given degree sequence.

[BibT_eX]

[DOI]

Petr A. Golovach

Archontia C. Giannopoulou

Theor. Comput. Sci., 2017

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Online Regenerator Placement.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

The Complexity of Optimal Design of Temporally Connected Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Minimum bisection is NP-hard on unit disk graphs.

[BibT_eX]

[DOI]

Josep Díaz

Inf. Comput., 2017

Determining majority in networks with local interactions and very small local memory.

[BibT_eX]

[DOI]

Distributed Comput., 2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

The Computational Complexity of Weighted Greedy Matching.

[BibT_eX]

[DOI]

Argyrios Deligkas

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Multitolerance Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Approximating Fixation Probabilities in the Generalized Moran Process.

[BibT_eX]

[DOI]

Archontia C. Giannopoulou

Encyclopedia of Algorithms, 2016

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

The Friendship Problem on Graphs.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2016

Ephemeral networks with random availability of links: The case of fast networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2016

On the intersection of tolerance and cocomparability graphs.

[BibT_eX]

[DOI]

Shmuel Zaks

Discret. Appl. Math., 2016

Intersection graphs of L-shapes and segments in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Fine-Grained Algorithm Design for Matching.

[BibT_eX]

[DOI]

CoRR, 2016

On the Complexity of Weighted Greedy Matchings.

[BibT_eX]

[DOI]

Argyrios Deligkas

CoRR, 2016

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

[BibT_eX]

[DOI]

Algorithmica, 2016

Stably Computing Order Statistics with Arithmetic Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Finding Secluded Places of Special Interest in Graphs.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Optimizing busy time on parallel machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Designing and Testing Temporally Connected Graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On Temporally Connected Graphs of Small Cost.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

Parameterized Domination in Circle Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Computing and counting longest paths on circular-arc graphs in polynomial time.

[BibT_eX]

[DOI]

Ivona Bezáková

Discret. Appl. Math., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

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

[BibT_eX]

[DOI]

Algorithmica, 2014

Approximating Fixation Probabilities in the Generalized Moran Process.

[BibT_eX]

[DOI]

Algorithmica, 2014

Ephemeral networks with random availability of links: diameter and connectivity.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

Natural models for evolution on networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On the Recognition of Four-Directional Orthogonal Ray Graphs.

[BibT_eX]

[DOI]

Stefan Felsner

Irina Mustata

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Temporal Network Optimization Subject to Connectivity Constraints.

[BibT_eX]

[DOI]

Othon Michail

Ioannis Chatzigiannakis

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Placing regenerators in optical networks to satisfy multiple sets of requests.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

The recognition of triangle graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

SIAM J. Discret. Math., 2012

Strong Bounds for Evolution in Undirected Graphs

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Can Fixation be Guaranteed in the Generalized Moran Process?

[BibT_eX]

[DOI]

CoRR, 2012

2011

The Recognition of Tolerance and Bounded Tolerance Graphs.

[BibT_eX]

[DOI]

Ignasi Sau

Shmuel Zaks

SIAM J. Comput., 2011

Vertex splitting and the recognition of trapezoid graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

Discret. Appl. Math., 2011

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

[BibT_eX]

[DOI]

Kyriaki Ioannidou

Stavros D. Nikolopoulos

Algorithmica, 2011

2010

Window-games between TCP flows.

[BibT_eX]

[DOI]

Pavlos S. Efraimidis

Lazaros Tsavlidis

Theor. Comput. Sci., 2010

An Optimal Algorithm for the <i>k</i>-Fixed-Endpoint Path Cover on Proper Interval Graphs.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

2009

A New Intersection Model and Improved Algorithms for Tolerance Graphs.

[BibT_eX]

[DOI]

Ignasi Sau

Shmuel Zaks

SIAM J. Discret. Math., 2009

The Longest Path Problem Is Polynomial on Interval Graphs.

[BibT_eX]

[DOI]

Kyriaki Ioannidou

Stavros D. Nikolopoulos

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

A matrix characterization of interval and proper interval graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.

[BibT_eX]

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2006

A polynomial algorithm for the k-cluster problem on the interval graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2005

The k-Cluster Over the Interval Graphs Lies in P

[BibT_eX]

[DOI]