| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6200548 | 2024-03-22 | Paper |
| Constructing extremal triangle-free graphs using integer programming | 2023-04-04 | Paper |
| Defensive domination in proper interval graphs | 2023-03-29 | Paper |
| Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs | 2023-03-09 | Paper |
| Well-indumatched Trees and Graphs of Bounded Girth | 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 | 2022-05-09 | Paper |
| Well-totally-dominated graphs | 2022-03-24 | Paper |
| Exact values of defective Ramsey numbers in graph classes | 2022-01-18 | Paper |
| On the maximum cardinality cut problem in proper interval graphs and related graph classes | 2021-12-01 | Paper |
| Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs | 2021-07-26 | Paper |
| An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs | 2021-06-04 | Paper |
| The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation | 2021-05-11 | Paper |
| Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem | 2020-11-09 | Paper |
| Mind the independence gap | 2020-07-08 | Paper |
| The complexity of the defensive domination problem in special graph classes | 2019-12-17 | Paper |
| Small 1-defective Ramsey numbers in perfect graphs | 2019-11-28 | Paper |
| Edge-stable equimatchable graphs | 2019-05-17 | Paper |
| On Almost Well-Covered Graphs of Girth at Least 6 | 2018-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560224 | 2018-12-10 | Paper |
| Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid | 2018-11-30 | Paper |
| Perfectness of clustered graphs | 2018-10-18 | Paper |
| Equimatchable claw-free graphs | 2018-08-15 | Paper |
| On two extensions of equimatchable graphs | 2018-05-24 | Paper |
| Advances on defective parameters in graphs | 2018-05-24 | Paper |
| On matching extendability of lexicographic products | 2018-02-23 | Paper |
| The maximum cardinality cut problem in co-bipartite chain graphs | 2018-02-21 | Paper |
| Complexity of the improper twin edge coloring of graphs | 2017-10-11 | Paper |
| Linear-Time Generation of Random Chordal Graphs | 2017-07-21 | Paper |
| Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded | 2017-02-27 | Paper |
| A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs | 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 | 2016-10-07 | Paper |
| Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) | 2016-08-16 | Paper |
| On some applications of the selective graph coloring problem | 2016-07-06 | Paper |
| Decomposition algorithms for solving the minimum weight maximal matching problem | 2016-06-10 | Paper |
| Graphs of edge-intersecting and non-splitting paths | 2016-05-27 | Paper |
| On the minimum and maximum selective graph coloring problems in some graph classes | 2016-04-07 | Paper |
| Improper Twin Edge Coloring of Graphs | 2016-01-10 | Paper |
| Efficient recognition of equimatchable graphs | 2015-06-25 | Paper |
| Hardness and approximation of minimum maximal matchings | 2014-12-29 | Paper |
| Block decomposition approach to compute a minimum geodetic set | 2014-11-07 | Paper |
| Corrigendum to ``Polar cographs | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747400 | 2014-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5396744 | 2014-02-03 | Paper |
| Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations | 2013-12-06 | Paper |
| Some defective parameters in graphs | 2013-05-13 | Paper |
| Polar permutation graphs are polynomial-time recognisable | 2013-01-24 | Paper |
| Integer programming formulations for the minimum weighted maximal matching problem | 2012-11-07 | Paper |
| Computing Minimum Geodetic Sets of Proper Interval Graphs | 2012-06-29 | Paper |
| Recognizing line-polar bipartite graphs in time \(O(n)\) | 2010-11-05 | Paper |
| Partitioning graphs into complete and empty graphs | 2009-12-15 | Paper |
| Polar Permutation Graphs | 2009-12-11 | Paper |
| On the approximation of Min Split-coloring and Min Cocoloring | 2009-01-19 | Paper |
| Polarity of chordal graphs | 2008-11-19 | Paper |
| A tutorial on the use of graph coloring for some problems in robotics | 2008-10-17 | Paper |
| Polar cographs | 2008-09-10 | Paper |
| Construction of balanced sports schedules using partitions into subleagues | 2008-09-10 | Paper |
| Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs | 2008-05-27 | Paper |
| On split-coloring problems | 2007-09-10 | Paper |
| Polar cographs | 2007-05-29 | Paper |
| (p, k)-coloring problems in line graphs | 2007-05-29 | Paper |
| \((p,k)\)-coloring problems in line graphs | 2006-03-20 | Paper |
| Construction of sports schedules with multiple venues | 2006-01-10 | Paper |
| Partitioning cographs into cliques and stable sets | 2005-10-10 | Paper |
| Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa | 2004-12-29 | Paper |
