On the public citation graph

Edge Dominating Sets in Graphs

0 signed · 376 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230080205openalex-snapshot
A recognition algorithm for the total graphs
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf02992776openalex-snapshot
On rigid circuit graphs
inferredcites →https://doi.org/10.1016/0095-8956(73)90059-2openalex-snapshot
Smallest maximal matchings in the graph of the d-dimensional cube
inferredcites →https://doi.org/10.1112/blms/1.3.431openalex-snapshot
INTRODUCTION TO COMBINATORIAL MATHEMATICS
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0210021openalex-snapshot
Edge-Deletion Problems
inferredcites →https://doi.org/10.1145/800133.804346openalex-snapshot
Algorithms for edge coloring bipartite graphs
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2317652openalex-snapshot
Introduction to Combinatorial Mathematics.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4876773openalex-extracted
Complexity and Algorithm for the Matching Cutset Problem
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0266openalex-snapshot
Domination Problems
inferred← citeshttps://doi.org/10.1002/9781118032497.ch10openalex-snapshot
Algorithms
inferred← citeshttps://doi.org/10.1002/jcd.21925openalex-snapshot
Incidence‐free sets and edge domination in incidence graphs
inferred← citeshttps://doi.org/10.1002/jgt.20434openalex-snapshot
Small maximal matchings of random cubic graphs
inferred← citeshttps://doi.org/10.1002/jgt.22529openalex-snapshot
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
inferred← citeshttps://doi.org/10.1002/nav.22265openalex-snapshot
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
inferred← citeshttps://doi.org/10.1002/net.20022openalex-snapshot
Cardinality constrained path covering problems in grid graphs
inferred← citeshttps://doi.org/10.1002/net.21516openalex-snapshot
Decomposition algorithms for solving the minimum weight maximal matching problem
inferred← citeshttps://doi.org/10.1002/net.21532openalex-snapshot
Network analysis for active and passive propagation models
inferred← citeshttps://doi.org/10.1002/net.22232openalex-snapshot
Getting linear time in graphs of bounded neighborhood diversity
inferred← citeshttps://doi.org/10.1006/inco.1996.0011openalex-snapshot
Maximal Common Subsequences and Minimal Common Supersequences
inferred← citeshttps://doi.org/10.1006/inco.1997.2641openalex-snapshot
Restrictions of Minimum Spanner Problems
inferred← citeshttps://doi.org/10.1006/jagm.2001.1192openalex-snapshot
Approximation Algorithms for the Achromatic Number
inferred← citeshttps://doi.org/10.1006/jagm.2002.1219openalex-snapshot
The Stable Roommates Problem with Ties
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_4openalex-snapshot
The Maximum Independent Set Problem and Augmenting Graphs
inferred← citeshttps://doi.org/10.1007/10719839_2openalex-snapshot
Small Maximal Matchings in Random Graphs
inferred← citeshttps://doi.org/10.1007/11533719_71openalex-snapshot
A Tight Analysis of the Maximal Matching Heuristic
inferred← citeshttps://doi.org/10.1007/11533719_76openalex-snapshot
Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems
inferred← citeshttps://doi.org/10.1007/11534273_21openalex-snapshot
Linear Time Algorithms for Generalized Edge Dominating Set Problems
inferred← citeshttps://doi.org/10.1007/11602613_81openalex-snapshot
Network Load Games
inferred← citeshttps://doi.org/10.1007/11611257_54openalex-snapshot
Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three
inferred← citeshttps://doi.org/10.1007/11847250_13openalex-snapshot
edge dominating set: Efficient Enumeration-Based Exact Algorithms
inferred← citeshttps://doi.org/10.1007/11970125_9openalex-snapshot
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_9openalex-snapshot
On Approximability of the Independent/Connected Edge Dominating Set Problems
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_44openalex-snapshot
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_35openalex-snapshot
Graph Separators: A Parameterized View
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_35openalex-snapshot
Randomized Approximation of the Stable Marriage Problem
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_13openalex-snapshot
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_11openalex-snapshot
Small k-Dominating Sets of Regular Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_22openalex-snapshot
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_35openalex-snapshot
Efficient Approximation Algorithms for the Achromatic Number
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_41openalex-snapshot
Stable Marriage with Incomplete Lists and Ties
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_16openalex-snapshot
Maximal common subsequences and minimal common supersequences
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_26openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_28openalex-snapshot
Algorithmic Aspects of Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3563-5_3openalex-snapshot
Wavelength Assignment
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_19openalex-snapshot
Weighted Upper Edge Cover: Complexity and Approximability
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_14openalex-snapshot
Tight Approximation Ratio for Minimum Maximal Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_13openalex-snapshot
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_46openalex-snapshot
Upper and Lower Bounds on Approximating Weighted Mixed Domination
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_24openalex-snapshot
Intersection Graphs of Non-crossing Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_9openalex-snapshot
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_28openalex-snapshot
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
inferred← citeshttps://doi.org/10.1007/978-3-030-58884-7_3openalex-snapshot
Utilizing Minimum Set-Cover Structures with Several Constraints for Knowledge Discovery on Large Literature Databases
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_17openalex-snapshot
Vertex Cover at Distance on H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92702-8_4openalex-snapshot
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-92702-8_5openalex-snapshot
On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-95018-7_20openalex-snapshot
Hardness and Approximation Results for Some Variants of Stable Marriage Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-08411-9_20openalex-snapshot
Biomedical Knowledge Graphs: Context, Queries and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_10openalex-snapshot
On the Complexity of Minimum Maximal Acyclic Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_29openalex-snapshot
Minimum Maximal Acyclic Matching in Proper Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_6openalex-snapshot
Parameterized Complexity of Generalizations of Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-032-08381-4_10openalex-snapshot
A Study on Dominating Set: NP-Hardness and Polynomial Results
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_18openalex-snapshot
On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_15openalex-snapshot
Parameterized Complexity of Edge Interdiction Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_9openalex-snapshot
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_16openalex-snapshot
Minimum-Cost $$b$$-Edge Dominating Sets on Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-14115-2_9openalex-snapshot
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_21openalex-snapshot
An Improved Algorithm for Parameterized Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_20openalex-snapshot
Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_12openalex-snapshot
On Approximating (Connected) 2-Edge Dominating Set by a Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_25openalex-snapshot
Mixed Dominating Set: A Parameterized Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_30openalex-snapshot
New Results on Weighted Independent Domination
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_43openalex-snapshot
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_19openalex-snapshot
Approximation Hardness of Dominating Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_26openalex-snapshot
Improved Approximation of the Stable Marriage Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_36openalex-snapshot
Approximating the Achromatic Number Problem on Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_21openalex-snapshot
Approximating Alternative Solutions
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_5openalex-snapshot
Tree-Width and Optimization in Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_14openalex-snapshot
Scheduling to Maximize Participation
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_32openalex-snapshot
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_20openalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_73openalex-snapshot
König Deletion Sets and Vertex Covers above the Matching Size
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_21openalex-snapshot
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_30openalex-snapshot
Approximating the Spanning k-Tree Forest Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_36openalex-snapshot
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_13openalex-snapshot
Harmonious Coloring on Subclasses of Colinear Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_41openalex-snapshot
The Prize-Collecting Edge Dominating Set Problem in Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_31openalex-snapshot
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_6openalex-snapshot
Enumerate and Measure: Improving Parameter Budget Management
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_5openalex-snapshot
Approximating Edge Dominating Set in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_14openalex-snapshot
Parameterized Edge Dominating Set in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_39openalex-snapshot
Domination When the Stars Are Out
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_32openalex-snapshot
On Totally Unimodularity of Edge-Edge Adjacency Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_54openalex-snapshot
New Parameterized Algorithms for the Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25462-8_22openalex-snapshot
An Approximation Algorithm for the Achromatic Number of Hex Derived Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_36openalex-snapshot
A Refined Exact Algorithm for Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_13openalex-snapshot
Matchings
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_44openalex-snapshot
Kernels for Edge Dominating Set: Simpler or Smaller
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_5openalex-snapshot
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_44openalex-snapshot
Efficient Equilibria in Polymatrix Coordination Games
inferred← citeshttps://doi.org/10.1007/978-981-19-5181-7_26openalex-snapshot
An Approximation Algorithm for the Achromatic Number of Web Graph
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_32openalex-snapshot
The Gate-Cover Problem
inferred← citeshttps://doi.org/10.1007/bf02986672openalex-snapshot
Edge domatic numbers of complete n- partite graphs
inferred← citeshttps://doi.org/10.1007/s00010-022-00869-3openalex-snapshot
Global forcing number for maximal matchings in corona products
inferred← citeshttps://doi.org/10.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferred← citeshttps://doi.org/10.1007/s00224-014-9549-5openalex-snapshot
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/s00224-017-9764-yopenalex-snapshot
On Approximating (Connected) 2-Edge Dominating Set by a Tree
inferred← citeshttps://doi.org/10.1007/s00373-015-1610-xopenalex-snapshot
Geometric Achromatic and Pseudoachromatic Indices
inferred← citeshttps://doi.org/10.1007/s00373-016-1720-0openalex-snapshot
Total Colorings of Graphs with Minimum Sum of Colors
inferred← citeshttps://doi.org/10.1007/s00373-022-02508-9openalex-snapshot
On Well-Edge-Dominated Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02626-yopenalex-snapshot
2-(Edge-)Connected Edge Domination Number and Matching Number
inferred← citeshttps://doi.org/10.1007/s00446-018-0344-4openalex-snapshot
Improved deterministic distributed matching via rounding
inferred← citeshttps://doi.org/10.1007/s00453-007-9057-yopenalex-snapshot
Linear Time Algorithms for Generalized Edge Dominating Set Problems
inferred← citeshttps://doi.org/10.1007/s00453-007-9133-3openalex-snapshot
On Two Techniques of Combining Branching and Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-010-9412-2openalex-snapshot
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00453-011-9546-xopenalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/s00453-011-9566-6openalex-snapshot
Parameterized Measure & Conquer for Problems with No Small Kernels
inferred← citeshttps://doi.org/10.1007/s00453-013-9804-1openalex-snapshot
On Total Unimodularity of Edge–Edge Adjacency Matrices
inferred← citeshttps://doi.org/10.1007/s00453-014-9921-5openalex-snapshot
$$b$$ b -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
inferred← citeshttps://doi.org/10.1007/s00453-018-0448-zopenalex-snapshot
Minimum-Cost b-Edge Dominating Sets on Trees
inferred← citeshttps://doi.org/10.1007/s00453-018-0497-3openalex-snapshot
Parameterized Algorithms and Kernels for Rainbow Matching
inferred← citeshttps://doi.org/10.1007/s00453-019-00618-0openalex-snapshot
Quadratic Vertex Kernel for Rainbow Matching
inferred← citeshttps://doi.org/10.1007/s00453-020-00789-1openalex-snapshot
Computing the Largest Bond and the Maximum Connected Cut of a Graph
inferred← citeshttps://doi.org/10.1007/s00453-024-01289-2openalex-snapshot
Complexity Framework for Forbidden Subgraphs I: The Framework
inferred← citeshttps://doi.org/10.1007/s10012-000-0129-zopenalex-snapshot
The Pseudoachromatic Number of a Graph
inferred← citeshttps://doi.org/10.1007/s10878-006-7908-0openalex-snapshot
Approximation hardness of edge dominating set problems
inferred← citeshttps://doi.org/10.1007/s10878-015-9872-zopenalex-snapshot
A complexity dichotomy and a new boundary class for the dominating set problem
inferred← citeshttps://doi.org/10.1007/s10878-020-00596-yopenalex-snapshot
The complexity of total edge domination and some related results on trees
inferred← citeshttps://doi.org/10.1007/s10878-020-00622-zopenalex-snapshot
Complexity and characterization aspects of edge-related domination for graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01144-8openalex-snapshot
The average size of maximal matchings in graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01200-3openalex-snapshot
On the complexity of minimum maximal acyclic matchings
inferred← citeshttps://doi.org/10.1007/s10878-025-01284-5openalex-snapshot
A sharp upper bound for the edge dominating number of hypergraphs with minimum degree
inferred← citeshttps://doi.org/10.1007/s10910-006-9217-3openalex-snapshot
Saturation number of fullerene graphs
inferred← citeshttps://doi.org/10.1007/s11590-011-0351-xopenalex-snapshot
Integer programming formulations for the minimum weighted maximal matching problem
inferred← citeshttps://doi.org/10.1007/s11590-018-1335-xopenalex-snapshot
Modelling and solving the perfect edge domination problem
inferred← citeshttps://doi.org/10.1007/s12190-013-0656-2openalex-snapshot
Minimum 2-tuple dominating set of permutation graphs
inferred← citeshttps://doi.org/10.1007/s40595-016-0066-0openalex-snapshot
Maximal assortative matching for real-world network graphs, random network graphs and scale-free network graphs
inferred← citeshttps://doi.org/10.1007/s40840-023-01649-1openalex-snapshot
Nordhaus–Gaddum-Type Results on the Connected Edge Domination Number
inferred← citeshttps://doi.org/10.1007/s42979-025-04038-6openalex-snapshot
FaRS: A Performance-Driven Approach to Role Similarity in Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90202-1openalex-snapshot
On the edge achromatic numbers of complete graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90239-popenalex-snapshot
Random edge domination
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90553-6openalex-snapshot
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90229-1openalex-snapshot
Edge domination in complete partite graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)94093-8openalex-snapshot
Edge domination on bipartite permutation graphs and cotriangulated graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90062-6openalex-snapshot
Concerning the achromatic number of graphs
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90258-5openalex-snapshot
Minimum-maximal matching in series-parallel graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50008-3openalex-snapshot
Generalized Colorings
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104177openalex-snapshot
Class fairness in online matching
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.06.011openalex-snapshot
Energy efficient joint data aggregation and link scheduling in solar sensor networks
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.052openalex-snapshot
Fractionally total colouring Gn,p
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.005openalex-snapshot
The harmonious coloring problem is NP-complete for interval and permutation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.08.030openalex-snapshot
Independent domination in finitely defined classes of graphs: Polynomial algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2015.02.010openalex-snapshot
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
inferred← citeshttps://doi.org/10.1016/j.dam.2016.02.008openalex-snapshot
Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.013openalex-snapshot
On some domination colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.061openalex-snapshot
Aspects of upper defensive alliances
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.010openalex-snapshot
On the semitotal domination number of line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.09.033openalex-snapshot
Edge-stable equimatchable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.012openalex-snapshot
On directed covering and domination problems
inferred← citeshttps://doi.org/10.1016/j.dam.2020.05.030openalex-snapshot
Domination versus edge domination
inferred← citeshttps://doi.org/10.1016/j.dam.2022.01.019openalex-snapshot
A new approach on locally checkable problems
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.042openalex-snapshot
Extension of some edge graph problems: Standard, parameterized and approximation complexity
inferred← citeshttps://doi.org/10.1016/j.dam.2023.08.022openalex-snapshot
Extremal graphs for average sizes of maximal matchings
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.009openalex-snapshot
The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.012openalex-snapshot
Minimum maximal acyclic matching in proper interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.05.001openalex-snapshot
Parameterized complexity of locally minimal defensive alliances
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.029openalex-snapshot
Graph problems and monotone classes
inferred← citeshttps://doi.org/10.1016/j.dam.2026.05.020openalex-snapshot
The achromatic number and the pseudoachromatic number of caterpillars
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.044openalex-snapshot
Results on the Grundy chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.031openalex-snapshot
Independent domination in graphs: A survey and recent results
inferred← citeshttps://doi.org/10.1016/j.disc.2014.12.002openalex-snapshot
Minimum order of graphs with given coloring parameters
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111943openalex-snapshot
Mind the independence gap
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112243openalex-snapshot
Bounding and approximating minimum maximal matchings in regular graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112283openalex-snapshot
On dominating set polyhedra of circular interval graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113498openalex-snapshot
Intersection graphs of non-crossing paths
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.11.004openalex-snapshot
Generalizing the induced matching by edge capacity constraints
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.08.002openalex-snapshot
On two extensions of equimatchable graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2004.07.015openalex-snapshot
On the independent dominating set polytope
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.10.011openalex-snapshot
An O(n) -time algorithm for the paired domination problem on permutation graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.048openalex-snapshot
Independent Domination in Triangle Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.059openalex-snapshot
On the Maximum Uniquely Restricted Matching for Bipartite Graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.005openalex-snapshot
Small Edge Dominating Sets of Regular Graphs
inferred← citeshttps://doi.org/10.1016/j.geb.2023.09.001openalex-snapshot
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences
inferred← citeshttps://doi.org/10.1016/j.ins.2022.11.048openalex-snapshot
Towards stable task assignment with preference lists and ties in spatial crowdsourcing
inferred← citeshttps://doi.org/10.1016/j.ipl.2002.12.001openalex-snapshot
A fixed-parameter tractable algorithm for matrix domination
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.02.006openalex-snapshot
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.02.005openalex-snapshot
A generalization of extension complexity that captures P
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.019openalex-snapshot
Maximum matching and kernelization of edge dominating set
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105914openalex-snapshot
Independent domination versus weighted independent domination
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105999openalex-snapshot
Grundy coloring in some subclasses of bipartite graphs and their complements
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106303openalex-snapshot
A note on approximations of directed edge dominating set
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106667openalex-snapshot
Faster parameterized algorithms for Achromatic Coloring
inferred← citeshttps://doi.org/10.1016/j.jda.2014.08.004openalex-snapshot
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
inferred← citeshttps://doi.org/10.1016/j.jda.2014.11.003openalex-snapshot
Small k-pyramids and the complexity of determining k
inferred← citeshttps://doi.org/10.1016/j.jksuci.2015.10.004openalex-snapshot
Maximal assortative matching for complex network graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.06.014openalex-snapshot
Parallel bioinspired algorithms for NP complete graph problems
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.11.093openalex-snapshot
Camera location for real-time traffic state estimation in urban road network using big GPS data
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107144openalex-snapshot
The total matching polytope of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.procs.2020.05.103openalex-snapshot
Approximation Algorithms for the Achromatic Number of Butterfly and Beneš Networks
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.223openalex-snapshot
Biclique transversal and biclique independen set
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.045openalex-snapshot
Randomized approximation of the stable marriage problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.007openalex-snapshot
Efficient approximation algorithms for the achromatic number
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.012openalex-snapshot
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.009openalex-snapshot
Approximability of the capacitated b -edge dominating set problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.013openalex-snapshot
NP-hard graph problems and boundary classes of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.047openalex-snapshot
Approximation algorithms for partially covering with edges
showing the first 200 of 365 · page through all 365
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.