| Publication | Date of Publication | Type |
|---|
| Tight bounds on adjacency labels for monotone graph classes | 2026-01-14 | Paper |
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
Algorithmica | 2025-11-25 | Paper |
Randomized communication and implicit graph representations
TheoretiCS | 2025-10-22 | Paper |
| Sharp thresholds in random simple temporal graphs | 2025-08-13 | Paper |
| Giant components in random temporal graphs | 2025-01-14 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-28 | Paper |
| Randomized communication and implicit representations for matrices and graphs of small sign-rank | 2024-11-28 | Paper |
| Optimal adjacency labels for subgraphs of Cartesian products | 2024-11-14 | Paper |
Small but unwieldy: a lower bound on adjacency labels for small classes
SIAM Journal on Computing | 2024-11-01 | Paper |
Independent transversals versus transversals
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Approximate and randomized algorithms for computing a second Hamiltonian cycle
Algorithmica | 2024-10-07 | Paper |
Optimal adjacency labels for subgraphs of Cartesian products
SIAM Journal on Discrete Mathematics | 2024-07-31 | Paper |
Sharp Thresholds in Random Simple Temporal Graphs
SIAM Journal on Computing | 2024-04-04 | Paper |
Union-closed sets and Horn Boolean functions
Journal of Combinatorial Theory. Series A | 2024-01-29 | Paper |
The Treewidth and Pathwidth of Graph Unions
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
European Journal of Combinatorics | 2024-01-23 | Paper |
Functionality of box intersection graphs
Results in Mathematics | 2024-01-19 | Paper |
Graphs with minimum fractional domatic number
Discrete Applied Mathematics | 2024-01-02 | Paper |
Randomized communication and implicit graph representations
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Graph parameters, implicit representations and factorial properties
Discrete Mathematics | 2023-07-19 | Paper |
Computing maximum matchings in temporal graphs
Journal of Computer and System Sciences | 2023-07-10 | Paper |
Succinct permutation graphs
Algorithmica | 2023-02-16 | Paper |
Computing maximum matchings in temporal graphs.
(available as arXiv preprint) | 2023-02-07 | Paper |
On Boolean threshold functions with minimum specification number
Information and Computation | 2022-12-08 | Paper |
Letter graphs and geometric grid classes of permutations
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
| Graph parameters, implicit representations and factorial properties | 2022-08-30 | Paper |
| Deleting edges to restrict the size of an epidemic in temporal networks | 2022-07-21 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2022-07-21 | Paper |
| Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559398 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Distributed minimum vertex coloring and maximum independent set in chordal graphs
Theoretical Computer Science | 2022-06-13 | Paper |
| Optimal Adjacency Labels for Subgraphs of Cartesian Products | 2022-06-06 | Paper |
| Giant Components in Random Temporal Graphs | 2022-05-30 | Paper |
scientific article; zbMATH DE number 7378380 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| Temporal vertex cover with a sliding time window | 2021-07-28 | Paper |
Sliding window temporal graph coloring
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Sliding window temporal graph coloring
Journal of Computer and System Sciences | 2021-06-30 | Paper |
Deleting edges to restrict the size of an epidemic in temporal networks
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Deleting edges to restrict the size of an epidemic in temporal networks
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Graph classes with linear Ramsey numbers
Discrete Mathematics | 2021-03-25 | Paper |
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences | 2020-09-07 | Paper |
How fast can we reach a target vertex in stochastic temporal graphs?
Journal of Computer and System Sciences | 2020-09-07 | Paper |
Letter graphs and geometric grid classes of permutations: characterization and recognition
Discrete Applied Mathematics | 2020-06-29 | Paper |
Clique-width for graph classes closed under complementation
SIAM Journal on Discrete Mathematics | 2020-06-09 | Paper |
Between clique-width and linear clique-width of bipartite graphs
Discrete Mathematics | 2020-06-08 | Paper |
| scientific article; zbMATH DE number 7204407 (Why is no real title available?) | 2020-05-26 | Paper |
Independent domination versus weighted independent domination
Information Processing Letters | 2020-02-11 | Paper |
Temporal vertex cover with a sliding time window
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Temporal vertex cover with a sliding time window
Journal of Computer and System Sciences | 2019-11-29 | Paper |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
(available as arXiv preprint) | 2019-10-11 | Paper |
Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Specifying a positive threshold function via extremal points | 2019-01-10 | Paper |
Specifying a positive threshold function via extremal points
(available as arXiv preprint) | 2019-01-10 | Paper |
Network structures uncertainty for different markets
Network Models in Economics and Finance | 2018-12-20 | Paper |
Linear read-once and related Boolean functions
Discrete Applied Mathematics | 2018-10-26 | Paper |
Linear read-once and related Boolean functions
Discrete Applied Mathematics | 2018-10-26 | Paper |
Measures of uncertainty in market network analysis
Physica A | 2018-09-20 | Paper |
Infinitely many minimal classes of graphs of unbounded clique-width
Discrete Applied Mathematics | 2018-09-17 | Paper |
Infinitely many minimal classes of graphs of unbounded clique-width
Discrete Applied Mathematics | 2018-09-17 | Paper |
| Linear Ramsey numbers | 2018-09-06 | Paper |
| Linear clique-width of bi-complement reducible graphs | 2018-09-06 | Paper |
Upper domination: towards a dichotomy through boundary properties
Algorithmica | 2018-07-26 | Paper |
On forbidden induced subgraphs for unit disk graphs
Discrete & Computational Geometry | 2018-07-26 | Paper |
Dominating induced matchings in graphs containing no long claw
Journal of Graph Theory | 2018-07-13 | Paper |
Dominating induced matchings in graphs containing no long claw
Journal of Graph Theory | 2018-07-13 | Paper |
Letter graphs and geometric grid classes of permutations: characterization and recognition
Lecture Notes in Computer Science | 2018-06-15 | Paper |
Well-quasi-ordering versus clique-width
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
The structure and the number of \(P_7\)-free bipartite graphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
| New results on weighted independent domination | 2018-01-04 | Paper |
More results on weighted independent domination
Theoretical Computer Science | 2017-10-17 | Paper |
More results on weighted independent domination
Theoretical Computer Science | 2017-10-17 | Paper |
The structure and the number of \(P_7\)-free bipartite graphs
European Journal of Combinatorics | 2017-08-31 | Paper |
Well-quasi-ordering does not imply bounded clique-width
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Well-quasi-ordering does not imply bounded clique-width
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
A boundary property for upper domination
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Combinatorics and algorithms for augmenting graphs
Graphs and Combinatorics | 2016-07-28 | Paper |
Market graph and Markowitz model
Optimization in Science and Engineering | 2015-10-05 | Paper |
| On factorial subclasses of \(K_{1,3}\)-free graphs | 2015-07-17 | Paper |
Boundary properties of factorial classes of graphs
Journal of Graph Theory | 2015-03-24 | Paper |
A tolerance-based heuristic approach for the weighted independent set problem
Journal of Combinatorial Optimization | 2015-02-16 | Paper |
Implicit representations and factorial properties of graphs
Discrete Mathematics | 2014-11-20 | Paper |
Corrigendum to ``Locally bounded coverings and factorial properties of graphs''
European Journal of Combinatorics | 2014-08-28 | Paper |
Almost all factorial subclasses of quasi-line graphs with respect to one forbidden subgraph
Moscow Journal of Combinatorics and Number Theory | 2012-09-05 | Paper |
On factorial properties of chordal bipartite graphs
Discrete Mathematics | 2012-08-10 | Paper |
Locally bounded coverings and factorial properties of graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
On estimation of the number of graphs in some hereditary classes
Discrete Mathematics and Applications | 2012-03-23 | Paper |
A note on the speed of hereditary graph properties
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
(available as arXiv preprint) | N/A | Paper |
Tight bounds on adjacency labels for monotone graph classes
(available as arXiv preprint) | N/A | Paper |
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
(available as arXiv preprint) | N/A | Paper |
