Victor Zamaraev

J. Comb. Theory, Ser. A, February, 2024

Graphs with minimum fractional domatic number.

[BibT_eX]

[DOI]

Discret. Appl. Math., January, 2024

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

CoRR, 2024

Accelerating Material Property Prediction using Generically Complete Isometry Invariants.

[BibT_eX]

[DOI]

Jonathan Balasingham

Vitaliy Kurlin

CoRR, 2024

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Computing maximum matchings in temporal graphs.

[BibT_eX]

[DOI]

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

Succinct Permutation Graphs.

[BibT_eX]

[DOI]

Konstantinos Tsakalidis

Sebastian Wild

Algorithmica, February, 2023

Graph parameters, implicit representations and factorial properties.

[BibT_eX]

[DOI]

Discret. Math., 2023

Tight bounds on adjacency labels for monotone graph classes.

[BibT_eX]

[DOI]

CoRR, 2023

Small But Unwieldy.

[BibT_eX]

[DOI]

CoRR, 2023

Functionality of box intersection graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Optimal Adjacency Labels for Subgraphs of Cartesian Products.

[BibT_eX]

[DOI]

Louis Esperet

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Giant Components in Random Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Letter Graphs and Geometric Grid Classes of Permutations.

[BibT_eX]

[DOI]

Robert Ferguson

Mamadou Moustapha Kanté

Vincent Vatter

SIAM J. Discret. Math., December, 2022

Distributed minimum vertex coloring and maximum independent set in chordal graphs.

[BibT_eX]

[DOI]

Christian Konrad

Theor. Comput. Sci., 2022

On Boolean threshold functions with minimum specification number.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Compact Graph Representation of molecular crystals using Point-wise Distance Distributions.

[BibT_eX]

[DOI]

Jonathan Balasingham

Vitaliy Kurlin

CoRR, 2022

Randomized communication and implicit graph representations.

[BibT_eX]

[DOI]

Sebastian Wild

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Faster Exploration of Some Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021

Sliding window temporal graph coloring.

[BibT_eX]

[DOI]

George B. Mertzios

Hendrik Molter

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

Graph classes with linear Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 2021

Randomized Communication and the Implicit Graph Conjecture.

[BibT_eX]

[DOI]

Sebastian Wild

CoRR, 2021

Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication.

[BibT_eX]

[DOI]

Christian Konrad

Peter Robinson

Christoforos L. Raptopoulos

CoRR, 2021

Sharp Thresholds in Random Simple Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Clique-Width for Graph Classes Closed under Complementation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 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

George B. Mertzios

Sotiris E. Nikoletseas

Paul G. Spirakis

J. Comput. Syst. Sci., 2020

Independent domination versus weighted independent domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

Between clique-width and linear clique-width of bipartite graphs.

[BibT_eX]

[DOI]

Mamadou Moustapha Kanté

Discret. Math., 2020

Letter graphs and geometric grid classes of permutations: Characterization and recognition.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Matching in Stochastically Evolving Graphs.

[BibT_eX]

[DOI]

CoRR, 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

Linear Programming complementation and its application to fractional graph theory.

[BibT_eX]

[DOI]

Maximilien Gadouleau

George B. Mertzios

CoRR, 2019

2018

Dominating induced matchings in graphs containing no long claw.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Well-quasi-ordering versus clique-width.

[BibT_eX]

[DOI]

Igor Razgon

J. Comb. Theory, Ser. B, 2018

On Forbidden Induced Subgraphs for Unit Disk Graphs.

[BibT_eX]

[DOI]

Aistis Atminas

Discret. Comput. Geom., 2018

Linear read-once and related Boolean functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Infinitely many minimal classes of graphs of unbounded clique-width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Upper Domination: Towards a Dichotomy Through Boundary Properties.

[BibT_eX]

[DOI]

Algorithmica, 2018

Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs.

[BibT_eX]

[DOI]

Christian Konrad

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Linear Ramsey Numbers.

[BibT_eX]

[DOI]

Aistis Atminas

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Linear Clique-Width of Bi-complement Reducible Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

More results on weighted independent domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The structure and the number of P<sub>7</sub>-free bipartite graphs.

[BibT_eX]

[DOI]

Konrad Kazimierz Dabrowski

Electron. Notes Discret. Math., 2017

New Results on Weighted Independent Domination.

[BibT_eX]

[DOI]

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

Specifying a positive threshold function via extremal points.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Combinatorics and Algorithms for Augmenting Graphs.

[BibT_eX]

[DOI]

Dominique de Werra

Graphs Comb., 2016

Independent Domination versus Weighted Independent Domination.

[BibT_eX]

[DOI]

Raffaele Mosca

CoRR, 2016

A Boundary Property for Upper Domination.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Boundary Properties of Factorial Classes of Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

A tolerance-based heuristic approach for the weighted independent set problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Implicit representations and factorial properties of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Well-quasi-ordering Does Not Imply Bounded Clique-width.

[BibT_eX]

[DOI]

Igor Razgon

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

2014

Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543].

[BibT_eX]

[DOI]

Colin Mayhill

Eur. J. Comb., 2014

2012

Locally bounded coverings and factorial properties of graphs.

[BibT_eX]

[DOI]

Colin Mayhill

Eur. J. Comb., 2012

On factorial properties of chordal bipartite graphs.

[BibT_eX]

[DOI]

Konrad K. Dabrowski

Discret. Math., 2012

2011

A Note on the Speed of Hereditary Graph Properties.

[BibT_eX]

[DOI]

Colin Mayhill