| Publication | Date of Publication | Type |
|---|
| Graphs whose vertices of degree at least 2 lie in a triangle | 2025-01-20 | Paper |
| Thinness and its variations on some graph families and coloring graphs of bounded thinness | 2024-06-05 | Paper |
| Relation between classes of graphs with interval count \(k\) | 2024-05-24 | Paper |
| About tree immersion in grids | 2024-05-06 | Paper |
| Notes on models for distance coloring problems | 2024-04-25 | Paper |
| The \(k\)-in-a-tree problem for chordal graphs | 2024-04-22 | Paper |
| Linear‐time algorithms for eliminating claws in graphs | 2023-11-29 | Paper |
| On distance graph coloring problems | 2023-11-21 | Paper |
| Weighted connected matchings | 2023-07-26 | Paper |
| Disconnected matchings | 2023-04-26 | Paper |
| Disconnected matchings | 2023-03-30 | Paper |
| FPT and kernelization algorithms for the induced tree problem | 2023-03-22 | Paper |
| Precedence thinness in graphs | 2022-11-02 | Paper |
| On subclasses of interval count two and on Fishburn's conjecture | 2022-11-02 | Paper |
| On the computational complexity of the bipartizing matching problem | 2022-09-26 | Paper |
| Restricted Hamming–Huffman trees | 2022-07-22 | Paper |
| On the computational complexity of the Helly number in the \(P_3\) and related convexities | 2022-04-27 | Paper |
| Two problems on interval counting | 2022-04-27 | Paper |
| Thinness of product graphs | 2022-03-24 | Paper |
| A polynomial time algorithm for geodetic hull number for complementary prisms | 2022-02-28 | Paper |
| Minimum Number of Bends of Paths of Trees in a Grid Embedding | 2021-09-06 | Paper |
| Partitioning a graph into complementary subgraphs | 2021-07-28 | Paper |
| B1-EPG representations using block-cutpoint trees | 2021-06-09 | Paper |
| Linear-time algorithms for eliminating claws in graphs | 2021-04-21 | Paper |
| The complexity of Helly-\(B_1\) EPG graph recognition | 2021-01-05 | Paper |
| Partitioning a graph into complementary subgraphs | 2020-07-22 | Paper |
| Thinness of product graphs | 2020-06-30 | Paper |
| Precedence thinness in graphs | 2020-06-30 | Paper |
| Constant threshold intersection graphs of orthodox paths in trees | 2020-05-29 | Paper |
| Modelling and solving the perfect edge domination problem | 2020-04-27 | Paper |
| Bipartizing with a matching | 2019-10-11 | Paper |
| On the \(P_3\)-hull number of some products of graphs | 2018-12-18 | Paper |
| And/or-convexity: a graph convexity based on processes and deadlock models | 2018-06-12 | Paper |
| Perfect edge domination: hard and solvable cases | 2018-06-12 | Paper |
| A computational study of \(f\)-reversible processes on graphs | 2018-05-24 | Paper |
| Recognition and characterization of unit interval graphs with integer endpoints | 2018-05-24 | Paper |
| The convexity of induced paths of order three and applications: complexity aspects | 2018-02-22 | Paper |
| Generalized threshold processes on graphs | 2017-09-07 | Paper |
| On the geodetic rank of a graph | 2017-07-25 | Paper |
| Decycling with a matching | 2017-06-13 | Paper |
| Exact algorithms for minimum weighted dominating induced matching | 2017-04-12 | Paper |
| On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs | 2017-02-14 | Paper |
| On recognition of threshold tolerance graphs and their complements | 2016-11-24 | Paper |
| On neighborhood-Helly graphs | 2016-11-24 | Paper |
| On \(f\)-reversible processes on graphs | 2016-10-17 | Paper |
| Efficient and perfect domination on circular-arc graphs | 2016-10-17 | Paper |
| On unit interval graphs with integer endpoints | 2016-10-17 | Paper |
| On extensions, linear extensions, upsets and downsets of ordered sets (extended abstract) | 2016-07-01 | Paper |
| Near-linear-time algorithm for the geodetic Radon number of grids | 2016-06-22 | Paper |
| Generating all the acyclic orientations of an undirected graph | 2016-06-16 | Paper |
| Forbidden induced subgraphs for bounded \(p\)-intersection number | 2015-12-08 | Paper |
| Scheduling problem with multi-purpose parallel machines | 2015-09-22 | Paper |
| A faster algorithm for the cluster editing problem on proper interval graphs | 2015-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5249236 | 2015-04-30 | Paper |
| On Helly hypergraphs with variable intersection sizes. | 2015-04-13 | Paper |
| Interval count of generalizations of threshold graphs | 2015-04-09 | Paper |
| The Maximum Number of Dominating Induced Matchings | 2015-03-24 | Paper |
| Complexity aspects of the computation of the rank of a graph | 2014-11-10 | Paper |
| Graphs of interval count two with a given partition | 2014-06-23 | Paper |
| Fast algorithms for some dominating induced matching problems | 2014-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419967 | 2014-06-11 | Paper |
| The Carathéodory number of the \(P_3\) convexity of chordal graphs | 2014-05-06 | Paper |
| Characterization of classical graph classes by weighted clique graphs | 2014-05-05 | Paper |
| \(O(n)\) time algorithms for dominating induced matching problems | 2014-03-31 | Paper |
| Isomorphism of graph classes related to the circular-ones property | 2014-02-14 | Paper |
| On defensive alliances and strong global offensive alliances | 2014-02-07 | Paper |
| Convex partitions of graphs induced by paths of order three | 2014-02-03 | Paper |
| An \(O ^{*}(1.1939^{n })\) time algorithm for minimum weighted dominating induced matching | 2014-01-14 | Paper |
| On the Carathéodory number of interval and graph convexities | 2014-01-13 | Paper |
| Towards a provably resilient scheme for graph-based watermarking | 2013-12-06 | Paper |
| Unit interval graphs: a story with open ends | 2013-11-01 | Paper |
| On the Carathéodory number for the convexity of paths of order three | 2013-11-01 | Paper |
| The colorful Helly property for hypergraphs | 2013-10-10 | Paper |
| Algorithmic and structural aspects of the \(P_3\)-Radon number | 2013-09-03 | Paper |
| Short models for unit interval graphs | 2013-07-19 | Paper |
| On the convexity of paths of length two in undirected graphs | 2013-07-04 | Paper |
| Normal Helly circular-arc graphs and its subclasses | 2013-04-25 | Paper |
| Induced decompositions of graphs | 2013-04-19 | Paper |
| Unit interval graphs of open and closed intervals | 2013-04-19 | Paper |
| Characterization and recognition of Radon-independent sets in split graphs | 2013-03-21 | Paper |
| The arboreal jump number of an order | 2013-03-20 | Paper |
| Exact algorithms for dominating induced matchings | 2013-01-31 | Paper |
| On the Carathéodory number for the convexity of paths of order three | 2013-01-04 | Paper |
| On the convexity number of graphs | 2012-12-27 | Paper |
| Reversible iterative graph processes | 2012-11-27 | Paper |
| On the geodetic Radon number of grids | 2012-11-22 | Paper |
| Mixed unit interval graphs | 2012-10-26 | Paper |
| On representing an interval graph using the minimum number of interval lengths | 2012-10-06 | Paper |
| Convex covers of graphs | 2012-10-06 | Paper |
| On weighted clique graphs | 2012-10-06 | Paper |
| Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs | 2012-09-04 | Paper |
| An upper bound on the \(P_3\)-Radon number | 2012-08-10 | Paper |
| Exact and approximation algorithms for error-detecting even codes | 2012-08-08 | Paper |
| On the Radon number for \(P _{3}\)-convexity | 2012-06-29 | Paper |
| Unit and single point interval graphs | 2012-06-18 | Paper |
| Arboricity, \(h\)-index, and dynamic algorithms | 2012-05-30 | Paper |
| Scheduling on parallel machines considering job-machine dependency constraints | 2012-05-13 | Paper |
| The colorful Helly theorem and general hypergraphs | 2012-05-04 | Paper |
| On subbetweennesses of trees: hardness, algorithms, and characterizations | 2012-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3094529 | 2011-10-25 | Paper |
| Connectivity and diameter in distance graphs | 2011-08-16 | Paper |
| Partitioning a graph into convex sets | 2011-08-09 | Paper |
| Irreversible conversion of graphs | 2011-07-14 | Paper |
| Powers of cycles, powers of paths, and distance graphs | 2011-04-19 | Paper |
| On counting interval lengths of interval graphs | 2011-04-19 | Paper |
| Stable marriages with forced pairs and forbidden pairs | 2011-04-04 | Paper |
| Uma Caracterização de Grafos Estrelados | 2011-04-04 | Paper |
| Characterization and representation problems for intersection betweennesses | 2011-03-10 | Paper |
| Linear-time recognition of Helly circular-arc models and graphs | 2011-03-02 | Paper |
| On the hull number of triangle-free graphs | 2010-12-03 | Paper |
| Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search | 2010-12-01 | Paper |
| Long cycles and paths in distance graphs | 2010-10-28 | Paper |
| Complexity aspects of the Helly property: graphs and hypergraphs | 2010-10-13 | Paper |
| Efficient construction of unit circular-arc models | 2010-08-16 | Paper |
| Complexity results related to monophonic convexity | 2010-08-13 | Paper |
| The clique operator on circular-arc graphs | 2010-08-13 | Paper |
| Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs | 2010-06-09 | Paper |
| Some remarks on the geodetic number of a graph | 2010-04-27 | Paper |
| Faster recognition of clique-Helly and hereditary clique-Helly graphs | 2010-03-24 | Paper |
| Biclique graphs and biclique matrices | 2010-03-15 | Paper |
| On transitive orientations with restricted covering graphs | 2010-01-29 | Paper |
| Complexity aspects of generalized Helly hypergraphs | 2010-01-29 | Paper |
| Cycles, Paths, Connectivity and Diameter in Distance Graphs | 2010-01-21 | Paper |
| On the computation of the hull number of a graph | 2009-12-15 | Paper |
| Characterizations and recognition of circular-arc graphs and subclasses: a survey | 2009-12-15 | Paper |
| Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs | 2009-09-03 | Paper |
| The Helly property on subfamilies of limited size | 2009-08-27 | Paper |
| Applying modular decomposition to parameterized cluster editing problems | 2009-08-06 | Paper |
| Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code | 2009-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615800 | 2009-03-24 | Paper |
| Unit Circular-Arc Graph Representations and Feasible Circulations | 2009-03-16 | Paper |
| Algorithms for finding clique-transversals of graphs | 2008-09-03 | Paper |
| A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs | 2008-07-15 | Paper |
| Proper Helly Circular-Arc Graphs | 2008-07-01 | Paper |
| Clique trees of chordal graphs: leafage and 3-asteroidals | 2008-06-05 | Paper |
| On cliques of Helly Circular-arc Graphs | 2008-06-05 | Paper |
| Algorithmic Aspects of Monophonic Convexity | 2008-06-05 | Paper |
| Convex Partitions of Graphs | 2008-06-05 | Paper |
| Linear-Interval Dimension and PI Orders | 2008-06-05 | Paper |
| Applying Modular Decomposition to Parameterized Bicluster Editing | 2008-06-03 | Paper |
| On hereditary Helly classes of graphs | 2008-05-27 | Paper |
| On the strong \(p\)-Helly property | 2008-04-16 | Paper |
| Biclique-Helly graphs | 2008-03-14 | Paper |
| Characterization and recognition of generalized clique-Helly graphs | 2007-11-30 | Paper |
| On the generation of bicliques of a graph | 2007-09-19 | Paper |
| Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs | 2007-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439664 | 2007-05-29 | Paper |
| A representation for the modular-pairs of a P4-reducible graph by modular decomposition | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439694 | 2007-05-29 | Paper |
| On the generation of bicliques of a graph | 2007-05-29 | Paper |
| Characterizations of treelike comparability graphs | 2007-04-02 | Paper |
| Characterizing intersection graphs of substars of a star. | 2007-03-29 | Paper |
| On clique-perfect and K-perfect graphs | 2007-03-29 | Paper |
| Algorithms for clique-independent sets on subclasses of circular-arc graphs | 2006-08-17 | Paper |
| On balanced graphs | 2006-01-13 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708495 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708496 | 2005-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708507 | 2005-11-18 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461446 | 2005-07-26 | Paper |
| Generating bicliques of a graph in lexicographic order | 2005-06-30 | Paper |
| On extensions, linear extensions, upsets and downsets of ordered sets | 2005-06-23 | Paper |
| Parity codes | 2005-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4810369 | 2004-09-06 | Paper |
| The stable marriage problem with restricted pairs. | 2004-03-14 | Paper |
| Self‐clique graphs and matrix permutations | 2004-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407448 | 2004-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437486 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437487 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437503 | 2003-12-02 | Paper |
| Optimal binary search trees with costs depending on the access paths. | 2003-08-17 | Paper |
| On clique-transversals and clique-independent sets | 2003-01-27 | Paper |
| Edge clique graphs and some classes of chordal graphs | 2002-11-17 | Paper |
| A note on transitive orientations with maximum sets of sources and sinks | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532752 | 2002-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779605 | 2002-04-15 | Paper |
| On clique graphs with linear size | 2001-10-30 | Paper |
| Stable marriages with restricted pairs | 2001-10-24 | Paper |
| A sufficient condition for self-clique graphs | 2001-10-24 | Paper |
| Linear-time algorithms for maximum sets of sources and sinks | 2001-09-23 | Paper |
| Clique-inverse graphs ofK3-free andK4-free graphs | 2001-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489244 | 2000-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940014 | 2000-03-01 | Paper |
| Recognizing clique graphs of directed and rooted path graphs | 1999-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242966 | 1999-09-10 | Paper |
| Even and odd pairs in comparability and in \(P_4\)-comparability graphs | 1999-05-31 | Paper |
| On clique-complete graphs | 1998-09-07 | Paper |
| Characterizing and edge-colouring split-indifference graphs | 1998-06-02 | Paper |
| Sources and sinks in comparability graphs | 1997-09-29 | Paper |
| On clique convergent graphs | 1996-07-14 | Paper |
| On edge transitivity of directed graphs | 1995-11-09 | Paper |
| Enumerating the kernels of a directed graph with no odd circuits | 1995-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304381 | 1994-10-10 | Paper |
| Clique Graphs of Chordal and Path Graphs | 1994-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976645 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470246 | 1988-01-01 | Paper |
| Minimizing mean flow time with parallel processors and resource constraints | 1987-01-01 | Paper |
| Job shop scheduling with unit time operations under resource constraints and release dates | 1987-01-01 | Paper |
| A note on the computation on the k-closure of a graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789367 | 1987-01-01 | Paper |
| Orientations with single source and sink | 1985-01-01 | Paper |
| On digraphs with a rooted tree structure | 1985-01-01 | Paper |
| Optimal multiway search trees for variable size keys | 1984-01-01 | Paper |
| Hamilton Paths in Grid Graphs | 1982-01-01 | Paper |
| Systems of distinct representatives for k families of sets | 1979-01-01 | Paper |
| Some properties of ternary trees | 1978-01-01 | Paper |
| A search strategy for the elementary cycles of a directed graph | 1976-01-01 | Paper |
| A structured program to generate all topological sorting arrangements | 1974-01-01 | Paper |
| Graphs whose vertices of degree at least 2 lie in a triangle | N/A | Paper |
| Thinness and its variations on some graph families and coloring graphs of bounded thinness | N/A | Paper |
