This paper improves the known bounds on the ratio between domination number and packing number in unit disk graphs and bridgeless claw-free cubic graphs.

This paper provides bounds on the neighborhood complexity of graphs with bounded treewidth and pathwidth, and constructs reaching these bounds.

This paper investigates the complexity of recognizing domatically critical graphs, which are graphs with maximum dominating sets that cannot be increased by deleting any edge.

This paper presents deterministic and randomized algorithms for the incremental dominating set problem in vertex-weighted graphs, achieving competitive ratios of O(Δ) and O(log^2Δ) respectively. It al…

This paper studies the computational complexity of Maximum Edge Open Packing Problem in distance-hereditary, biconvex bipartite, and chordal graphs, providing polynomial-time algorithms and a fixed-pa…

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

This paper studies the maximum size of an independent set in the discrete simplex graph and provides new bounds using translated smaller graphs and finite rational linear systems.

The paper provides constant-factor approximation algorithms for Max Dist-2 Independent Set and Min Dominating Set in graphs of bounded radius-2 merge-width.

This paper shows #P-completeness for several graph counting problems using a new technique.

This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.

This paper studies set-defined graph classes and proves that bounded unions of shift-colorable graphs form the fundamental obstruction to chromatic number boundness in these classes.

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…