| Publication | Date of Publication | Type |
|---|
| Moderate exponential-time algorithms for scheduling problems | 2022-11-17 | Paper |
| Enumeration and maximum number of minimal dominating sets for chordal graphs | 2019-08-13 | Paper |
| Enumeration and maximum number of maximal irredundant sets for chordal graphs | 2019-07-17 | Paper |
| Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques | 2019-03-11 | Paper |
| Exact algorithms for weak Roman domination | 2018-09-17 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2018-05-23 | Paper |
| Exact exponential algorithms for 3-machine flowshop scheduling problems | 2018-04-13 | Paper |
| The many facets of upper domination | 2018-03-13 | Paper |
| Fixing improper colorings of graphs | 2018-02-16 | Paper |
| Enumeration and maximum number of maximal irredundant sets for chordal graphs | 2018-01-04 | Paper |
| Exact exponential algorithms to find tropical connected sets of minimum size | 2017-05-11 | Paper |
| Enumerating Minimal Tropical Connected Sets | 2017-04-04 | Paper |
| Treewidth and pathwidth parameterized by the vertex cover number | 2016-11-24 | Paper |
| Algorithmic Aspects of Upper Domination: A Parameterised Perspective | 2016-11-09 | Paper |
| Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques | 2016-10-21 | Paper |
| Upper Domination: Complexity and Approximation | 2016-09-29 | Paper |
| On finding optimal polytrees | 2015-10-08 | Paper |
| End-Vertices of Graph Search Algorithms | 2015-09-21 | Paper |
| Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size | 2015-09-15 | Paper |
| Fixing improper colorings of graphs | 2015-02-20 | Paper |
| On the number of minimal dominating sets on some graph classes | 2014-12-02 | Paper |
| Complexity of splits reconstruction for low-degree trees | 2014-11-28 | Paper |
| Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes | 2014-11-18 | Paper |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques | 2014-09-02 | Paper |
| (Circular) backbone colouring: forest backbones in planar graphs | 2014-05-06 | Paper |
| Determining the \(L(2,1)\)-span in polynomial space | 2014-04-22 | Paper |
| Solving Capacitated Dominating Set by using covering by subsets and maximum matching | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403013 | 2014-03-25 | Paper |
| Exact Algorithms for Weak Roman Domination | 2014-01-17 | Paper |
| Fast exact algorithm for \(L(2,1)\)-labeling of graphs | 2014-01-16 | Paper |
| On an extension of the Sort \& Search method with application to scheduling theory | 2014-01-13 | Paper |
| Treewidth and Pathwidth Parameterized by the Vertex Cover Number | 2013-08-12 | Paper |
| Colorings with few colors: counting, enumeration and combinatorial bounds | 2013-08-01 | Paper |
| Exact exponential-time algorithms for finding bicliques | 2013-04-04 | Paper |
| Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} | 2013-03-05 | Paper |
| Determining the L(2,1)-Span in Polynomial Space | 2012-11-06 | Paper |
| On independent sets and bicliques in graphs | 2012-04-26 | Paper |
| An exact algorithm for the maximum leaf spanning tree problem | 2012-01-09 | Paper |
| Complexity of Splits Reconstruction for Low-Degree Trees | 2011-12-16 | Paper |
| Branch and recharge: exact algorithms for generalized domination | 2011-09-20 | Paper |
| Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack | 2011-08-23 | Paper |
| An exact algorithm for connected red-blue dominating set | 2011-08-23 | Paper |
| Fast Exact Algorithm for L(2,1)-Labeling of Graphs | 2011-07-01 | Paper |
| Exact algorithms for \(L(2,1)\)-labeling of graphs | 2011-03-02 | Paper |
| Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching | 2010-11-16 | Paper |
| Sort and Search: exact algorithms for generalized domination | 2010-08-20 | Paper |
| An Exact Algorithm for Connected Red-Blue Dominating Set | 2010-05-28 | Paper |
| A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance | 2010-05-28 | Paper |
| Finding a dominating set on bipartite graphs | 2010-04-19 | Paper |
| Iterative compression and exact algorithms | 2010-03-09 | Paper |
| An Exact Algorithm for the Maximum Leaf Spanning Tree Problem | 2010-01-14 | Paper |
| Efficient algorithms for Roman domination on some classes of graphs | 2009-03-04 | Paper |
| Branch and Recharge: Exact Algorithms for Generalized Domination | 2009-02-17 | Paper |
| Iterative Compression and Exact Algorithms | 2009-02-03 | Paper |
| On Independent Sets and Bicliques in Graphs | 2009-01-20 | Paper |
| Exact Algorithms for L(2,1)-Labeling of Graphs | 2008-09-17 | Paper |
| A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs | 2008-09-04 | Paper |
| An Exact Algorithm for the Minimum Dominating Clique Problem | 2008-06-03 | Paper |
| An exact algorithm for the minimum dominating clique problem | 2007-10-18 | Paper |
| Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes | 2007-09-07 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
