| Publication | Date of Publication | Type |
|---|
On balanceable and simply balanceable regular graphs
European Journal of Combinatorics | 2024-12-27 | Paper |
On constrained intersection representations of graphs and digraphs
| 2024-09-11 | Paper |
Graphs with at most two moplexes
Journal of Graph Theory | 2024-08-30 | Paper |
Bisimplicial separators
Journal of Graph Theory | 2024-07-02 | Paper |
Upper Clique Transversals in Graphs
| 2024-05-03 | Paper |
Treewidth versus clique number. II: Tree-independence number
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Functionality of box intersection graphs
Results in Mathematics | 2024-01-19 | Paper |
Computing well-covered vector spaces of graphs using modular decomposition
Computational and Applied Mathematics | 2024-01-05 | Paper |
Bisimplicial separators
| 2023-12-17 | Paper |
Shifting paths to avoidable ones
Journal of Graph Theory | 2023-10-05 | Paper |
Fair allocation algorithms for indivisible items under structured conflict constraints
Computational and Applied Mathematics | 2023-10-02 | Paper |
Allocation of indivisible items with individual preference graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
Fair allocation of indivisible items with conflict graphs
Algorithmica | 2023-04-28 | Paper |
Allocating indivisible items with minimum dissatisfaction on preference graphs
| 2023-03-31 | Paper |
Treewidth is NP-Complete on Cubic Graphs (and related results)
| 2023-01-24 | Paper |
Strong cliques and stable sets
| 2022-12-21 | Paper |
Strong cliques in diamond-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Treewidth versus clique number in graph classes with a forbidden structure
| 2022-12-21 | Paper |
Edge elimination and weighted graph classes
| 2022-12-21 | Paper |
Fair Packing of Independent Sets
Lecture Notes in Computer Science | 2022-10-13 | Paper |
On minimally tough chordal graphs
| 2022-10-01 | Paper |
scientific article; zbMATH DE number 7583650 (Why is no real title available?)
| 2022-09-09 | Paper |
Avoidability beyond paths
| 2022-08-26 | Paper |
Computing Tree Decompositions with Small Independence Number
| 2022-07-20 | Paper |
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
| 2022-06-30 | Paper |
A characterization of claw-free CIS graphs and new results on the order of CIS graphs
| 2022-04-27 | Paper |
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
Journal of Graph Theory | 2022-03-31 | Paper |
Vertex cover at distance on \(H\)-free graphs
| 2022-03-22 | Paper |
Avoidable vertices and edges in graphs: existence, characterization, and applications
Discrete Applied Mathematics | 2022-01-13 | Paper |
Treewidth versus clique number. I: Graph classes with a forbidden structure
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
Graphs with at most two moplexes
| 2021-06-18 | Paper |
Searching for square-complementary graphs: complexity of recognition and further nonexistence results
Discrete Mathematics | 2021-04-28 | Paper |
Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
The Electronic Journal of Combinatorics | 2021-03-17 | Paper |
Strong cliques in diamond-free graphs
Theoretical Computer Science | 2021-02-03 | Paper |
Complexity and algorithms for constant diameter augmentation problems
| 2020-10-01 | Paper |
On the degree sequences of dual graphs on surfaces
| 2020-08-02 | Paper |
Mind the independence gap
Discrete Mathematics | 2020-07-08 | Paper |
Induced embeddings into Hamming graphs
| 2020-05-26 | Paper |
Non realizable degree sequences of dual graphs on surfaces
| 2020-05-19 | Dataset |
Fair allocation of indivisible items with conflict graphs
| 2020-03-25 | Paper |
Minimal separators in graph classes defined by small forbidden induced subgraphs
| 2020-02-24 | Paper |
A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs
| 2020-02-24 | Paper |
Bipartite graphs of small readability
Theoretical Computer Science | 2020-01-16 | Paper |
Avoidable vertices and edges in graphs
| 2020-01-16 | Paper |
New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
Theoretical Computer Science | 2019-10-18 | Paper |
Decomposing 1-Sperner hypergraphs
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Avoidable Vertices and Edges in Graphs
| 2019-07-28 | Paper |
Linear separation of connected dominating sets in graphs
Ars Mathematica Contemporanea | 2019-07-25 | Paper |
Detecting strong cliques
Discrete Mathematics | 2019-07-18 | Paper |
Minimal separators in graph classes defined by small forbidden induced subgraphs
| 2019-03-11 | Paper |
A characterization of claw-free CIS graphs and new results on the order of CIS graphs
| 2018-12-13 | Paper |
On almost well-covered graphs of girth at least 6
| 2018-12-10 | Paper |
A dichotomy for weighted efficient dominating sets with bounded degree vertices
Information Processing Letters | 2018-12-05 | Paper |
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
| 2018-11-30 | Paper |
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
Discrete Applied Mathematics | 2018-10-26 | Paper |
Bipartite graphs of small readability
Lecture Notes in Computer Science | 2018-10-04 | Paper |
1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs
Discrete Applied Mathematics | 2018-09-17 | Paper |
Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs
| 2018-08-17 | Paper |
On total domination in the Cartesian product of graphs
Discussiones Mathematicae Graph Theory | 2018-08-10 | Paper |
On two extensions of equimatchable graphs
Discrete Optimization | 2018-05-24 | Paper |
A three-person deterministic graphical game without Nash equilibria
Discrete Applied Mathematics | 2018-05-24 | Paper |
Vector connectivity in graphs
Networks | 2018-05-23 | Paper |
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
| 2018-05-09 | Paper |
Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
Algorithmica | 2018-04-06 | Paper |
Graphs vertex-partitionable into strong cliques
Discrete Mathematics | 2018-04-05 | Paper |
The minimum conflict-free row split problem revisited
| 2018-01-04 | Paper |
Domination parameters with number 2: interrelations and algorithmic consequences
Discrete Applied Mathematics | 2017-12-06 | Paper |
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Theoretical Computer Science | 2017-11-16 | Paper |
Finding a perfect phylogeny from mixed tumor samples
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Partial characterizations of 1-perfectly orientable graphs
Journal of Graph Theory | 2017-07-05 | Paper |
On the complexity of the identifiable subgraph problem, revisited
Discrete Applied Mathematics | 2017-06-14 | Paper |
\(1\)-perfectly orientable graphs and graph products
Discrete Mathematics | 2017-05-10 | Paper |
Equistarable graphs and counterexamples to three conjectures on equistable graphs
Journal of Graph Theory | 2017-04-21 | Paper |
On three extensions of equimatchable graphs
| 2017-02-14 | Paper |
1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs
| 2017-02-13 | Paper |
On equistable, split, CIS, and related classes of graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Recognizing \(k\)-equistable graphs in FPT time
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
The price of connectivity for cycle transversals
European Journal of Combinatorics | 2016-08-16 | Paper |
Equistarable bipartite graphs
Discrete Mathematics | 2016-04-27 | Paper |
On the readability of overlap digraphs
Discrete Applied Mathematics | 2016-04-07 | Paper |
Strong cliques and equistability of EPT graphs
Discrete Applied Mathematics | 2016-03-18 | Paper |
A decomposition theorem for {ISK4,wheel}-free trigraphs
| 2016-02-07 | Paper |
Graph classes with and without powers of bounded clique-width
Discrete Applied Mathematics | 2015-12-10 | Paper |
On a class of graphs between threshold and total domishold graphs
Discrete Applied Mathematics | 2015-09-21 | Paper |
The price of connectivity for cycle transversals
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
On the Readability of Overlap Digraphs
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On the complexity of the vector connectivity problem
Theoretical Computer Science | 2015-07-13 | Paper |
Group irregularity strength of connected graphs
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
Spread of influence in weighted networks under time and budget constraints
Theoretical Computer Science | 2015-05-26 | Paper |
On the complexity of the identifiable subgraph problem
Discrete Applied Mathematics | 2015-02-06 | Paper |
Maximum independent sets in graphs of low degree
| 2014-12-18 | Paper |
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
Information Processing Letters | 2014-12-09 | Paper |
Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
Discrete Applied Mathematics | 2014-12-03 | Paper |
Vertex-transitive CIS graphs
European Journal of Combinatorics | 2014-11-19 | Paper |
A note on domination and independence-domination numbers of graphs
Ars Mathematica Contemporanea | 2014-10-22 | Paper |
Graphs without large apples and the maximum weight independent set problem
Graphs and Combinatorics | 2014-09-19 | Paper |
Dominating sequences in graphs
Discrete Mathematics | 2014-09-04 | Paper |
A characterization of line graphs that are squares of graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
Set graphs. IV. Further connections with claw-freeness
Discrete Applied Mathematics | 2014-08-22 | Paper |
Set graphs. II. Complexity of set graph recognition and similar problems
Theoretical Computer Science | 2014-07-25 | Paper |
Graphs whose complement and square are isomorphic
Discrete Mathematics | 2014-05-06 | Paper |
Equistable simplicial, very well-covered, and line graphs
Discrete Applied Mathematics | 2014-05-05 | Paper |
Latency-bounded target set selection in social networks
Theoretical Computer Science | 2014-04-29 | Paper |
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics | 2014-04-16 | Paper |
On CIS circulants
Discrete Mathematics | 2014-01-27 | Paper |
Induced subtrees in interval graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Simple and fast reoptimizations for the Steiner tree problem
Algorithmic Operations Research | 2013-12-11 | Paper |
Linear separation of total dominating sets in graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Improved inequality between Zagreb indices of trees
MATCH - Communications in Mathematical and in Computer Chemistry | 2013-10-30 | Paper |
On the plane-width of graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
New polynomial cases of the weighted efficient domination problem
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Latency-bounded target set selection in social networks
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Hereditary efficiently dominatable graphs
Journal of Graph Theory | 2013-07-31 | Paper |
The exact weighted independent set problem in perfect graphs and related classes
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Vector connectivity in graphs
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Dilation coefficient, plane-width, and resolution coefficient of graphs
Monatshefte für Mathematik | 2013-05-13 | Paper |
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
Critical properties of graphs of bounded clique-width
Discrete Mathematics | 2013-04-11 | Paper |
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Discrete Applied Mathematics | 2013-03-12 | Paper |
Resilience and optimization of identifiable bipartite graphs
Discrete Applied Mathematics | 2013-03-12 | Paper |
On the recognition of \(k\)-equistable graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Complexity of independent set reconfigurability problems
Theoretical Computer Science | 2012-08-08 | Paper |
Graphs of separability at most 2
Discrete Applied Mathematics | 2012-05-11 | Paper |
Complexity results for equistable graphs and related classes
Annals of Operations Research | 2011-11-17 | Paper |
Competitive evaluation of threshold functions in the priced information model
Annals of Operations Research | 2011-11-17 | Paper |
The plane-width of graphs
Journal of Graph Theory | 2011-11-15 | Paper |
Shortest paths between shortest paths
Theoretical Computer Science | 2011-10-10 | Paper |
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Equistable graphs, general partition graphs, triangle graphs, and graph products
Discrete Applied Mathematics | 2011-08-10 | Paper |
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
Discrete Applied Mathematics | 2011-08-10 | Paper |
Shortest Paths between Shortest Paths and Independent Sets
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Graphs of separability at most two: structural characterizations and their consequences
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On the maximum independent set problem in subclasses of planar graphs
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics | 2010-04-28 | Paper |
Structural identifiability in low-rank matrix factorization
Algorithmica | 2010-02-23 | Paper |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms | 2009-02-23 | Paper |
The Maximum Independent Set Problem in Planar Graphs
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Computing with Priced Information: When the Value Makes the Price
Algorithms and Computation | 2009-01-29 | Paper |
On finding augmenting graphs
Discrete Applied Mathematics | 2008-11-19 | Paper |
Tree-Width and Optimization in Bounded Degree Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
| N/A | Paper |
Detecting $K_{2,3}$ as an induced minor
| N/A | Paper |
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
| N/A | Paper |
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
| N/A | Paper |
On balanceable and simply balanceable regular graphs
| N/A | Paper |
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
| N/A | Paper |
Excluding a clique or a biclique in graphs of bounded induced matching treewidth
| N/A | Paper |
