| Publication | Date of Publication | Type |
|---|
Constructing extremal triangle-free graphs using integer programming
Discrete Optimization | 2025-07-16 | Paper |
| Critical equimatchable graphs | 2024-03-22 | Paper |
Critical equimatchable graphs
(available as arXiv preprint) | 2024-03-22 | Paper |
| Constructing extremal triangle-free graphs using integer programming | 2023-04-04 | Paper |
Defensive domination in proper interval graphs
Discrete Applied Mathematics | 2023-03-29 | Paper |
Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs
Graphs and Combinatorics | 2023-03-09 | Paper |
| Well-indumatched Trees and Graphs of Bounded Girth | 2023-01-10 | Paper |
Well-indumatched Trees and Graphs of Bounded Girth
(available as arXiv preprint) | 2023-01-10 | Paper |
| Maximum size of a triangle-free graph with bounded maximum degree and matching number | 2022-07-05 | Paper |
Generation of random chordal graphs using subtrees of a tree
RAIRO - Operations Research | 2022-05-09 | Paper |
Well-totally-dominated graphs
Ars Mathematica Contemporanea | 2022-03-24 | Paper |
Exact values of defective Ramsey numbers in graph classes
Discrete Optimization | 2022-01-18 | Paper |
On the maximum cardinality cut problem in proper interval graphs and related graph classes
Theoretical Computer Science | 2021-12-01 | Paper |
On the maximum cardinality cut problem in proper interval graphs and related graph classes
Theoretical Computer Science | 2021-12-01 | Paper |
Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs
(available as arXiv preprint) | 2021-07-26 | Paper |
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
European Journal of Operational Research | 2021-06-04 | Paper |
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
INFORMS Journal on Computing | 2020-11-09 | Paper |
Mind the independence gap
Discrete Mathematics | 2020-07-08 | Paper |
The complexity of the defensive domination problem in special graph classes
Discrete Mathematics | 2019-12-17 | Paper |
Small 1-defective Ramsey numbers in perfect graphs
Discrete Optimization | 2019-11-28 | Paper |
Edge-stable equimatchable graphs
Discrete Applied Mathematics | 2019-05-17 | Paper |
On almost well-covered graphs of girth at least 6
(available as arXiv preprint) | 2018-12-10 | Paper |
| On almost well-covered graphs of girth at least 6 | 2018-12-10 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II
(available as arXiv preprint) | 2018-12-10 | Paper |
| Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. II | 2018-12-10 | Paper |
Graphs of edge-intersecting and non-splitting one bend paths in a grid
(available as arXiv preprint) | 2018-11-30 | Paper |
| Graphs of edge-intersecting and non-splitting one bend paths in a grid | 2018-11-30 | Paper |
Perfectness of clustered graphs
Discrete Optimization | 2018-10-18 | Paper |
Equimatchable claw-free graphs
Discrete Mathematics | 2018-08-15 | Paper |
On two extensions of equimatchable graphs
Discrete Optimization | 2018-05-24 | Paper |
Advances on defective parameters in graphs
Discrete Optimization | 2018-05-24 | Paper |
On matching extendability of lexicographic products
RAIRO - Operations Research | 2018-02-23 | Paper |
The maximum cardinality cut problem in co-bipartite chain graphs
Journal of Combinatorial Optimization | 2018-02-21 | Paper |
Complexity of the improper twin edge coloring of graphs
Graphs and Combinatorics | 2017-10-11 | Paper |
Linear-time generation of random chordal graphs
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Discrete Mathematics | 2017-02-27 | Paper |
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
Information Processing Letters | 2017-02-21 | Paper |
| On three extensions of equimatchable graphs | 2017-02-14 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
Discrete Applied Mathematics | 2016-10-07 | Paper |
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
Discrete Mathematics | 2016-08-16 | Paper |
On some applications of the selective graph coloring problem
European Journal of Operational Research | 2016-07-06 | Paper |
Decomposition algorithms for solving the minimum weight maximal matching problem
Networks | 2016-06-10 | Paper |
Graphs of edge-intersecting and non-splitting paths
Theoretical Computer Science | 2016-05-27 | Paper |
On the minimum and maximum selective graph coloring problems in some graph classes
Discrete Applied Mathematics | 2016-04-07 | Paper |
| Improper Twin Edge Coloring of Graphs | 2016-01-10 | Paper |
Efficient recognition of equimatchable graphs
Information Processing Letters | 2015-06-25 | Paper |
Hardness and approximation of minimum maximal matchings
International Journal of Computer Mathematics | 2014-12-29 | Paper |
Block decomposition approach to compute a minimum geodetic set
RAIRO. Operations Research | 2014-11-07 | Paper |
Corrigendum to ``Polar cographs
Discrete Applied Mathematics | 2014-05-06 | Paper |
| A note on the NP-hardness of two matching problems in induced subgrids | 2014-02-14 | Paper |
| Split-critical and uniquely split-colorable graphs | 2014-02-03 | Paper |
Graphs of edge-intersecting non-splitting paths in a tree: towards hole representations (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Some defective parameters in graphs
Graphs and Combinatorics | 2013-05-13 | Paper |
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics | 2013-01-24 | Paper |
Integer programming formulations for the minimum weighted maximal matching problem
Optimization Letters | 2012-11-07 | Paper |
Computing minimum geodetic sets of proper interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Recognizing line-polar bipartite graphs in time \(O(n)\)
Discrete Applied Mathematics | 2010-11-05 | Paper |
Partitioning graphs into complete and empty graphs
Discrete Mathematics | 2009-12-15 | Paper |
Polar permutation graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Polarity of chordal graphs
Discrete Applied Mathematics | 2008-11-19 | Paper |
A tutorial on the use of graph coloring for some problems in robotics
European Journal of Operational Research | 2008-10-17 | Paper |
Polar cographs
Discrete Applied Mathematics | 2008-09-10 | Paper |
Construction of balanced sports schedules using partitions into subleagues
Operations Research Letters | 2008-09-10 | Paper |
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On split-coloring problems
Journal of Combinatorial Optimization | 2007-09-10 | Paper |
Polar cographs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
(p, k)-coloring problems in line graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
\((p,k)\)-coloring problems in line graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Construction of sports schedules with multiple venues
Discrete Applied Mathematics | 2006-01-10 | Paper |
Partitioning cographs into cliques and stable sets
Discrete Optimization | 2005-10-10 | Paper |
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa
International Journal of Computer Mathematics | 2004-12-29 | Paper |
