On the public citation graph
Minimum Edge Dominating Sets
0 signed · 124 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190090416openalex-snapshot
On partitioning the edges of graphs into connected subgraphs
inferredcites →https://doi.org/10.1016/0012-365x(78)90105-xopenalex-snapshot
On domination and independent domination numbers of a graph
inferredcites →https://doi.org/10.1016/0012-365x(90)90287-ropenalex-snapshot
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
inferredcites →https://doi.org/10.1016/0020-0190(80)90140-4openalex-snapshot
Maximum matchings and trees
inferredcites →https://doi.org/10.1016/0095-8956(80)90074-xopenalex-snapshot
On maximal independent sets of vertices in claw-free graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
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/0605034openalex-snapshot
The k -Domination and k -Stability Problems on Sun-Free Chordal Graphs
inferredcites →https://doi.org/10.1137/0608044openalex-snapshot
A Dynamic Programming Approach to the Dominating Set Problem on k -Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/net.21516openalex-snapshot
Decomposition algorithms for solving the minimum weight maximal matching problem
inferred← citeshttps://doi.org/10.1006/jagm.2002.1219openalex-snapshot
The Stable Roommates Problem with Ties
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_115openalex-snapshot
Pareto Optimality in House Allocation Problems
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/11671411_1openalex-snapshot
“Almost Stable” Matchings in the Roommates Problem
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-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/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-57852-7_3openalex-snapshot
On the Complexity of the Upper r-Tolerant Edge Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_49openalex-snapshot
On the d-Claw Vertex Deletion Problem
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-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-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-67190-1_3openalex-snapshot
Expected Outcomes and Manipulations in Online Fair Division
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-30551-4_3openalex-snapshot
Pareto Optimality in House Allocation Problems
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-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-20877-5_5openalex-snapshot
Approximating Edge Dominating Set in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45046-4_34openalex-snapshot
The Complexity of Computing the Random Priority Allocation Matrix
inferred← citeshttps://doi.org/10.1007/978-981-13-3059-9_8openalex-snapshot
Some Hard Stable Marriage Problems: A Survey on Multivariate Analysis
inferred← citeshttps://doi.org/10.1007/s00373-022-02508-9openalex-snapshot
On Well-Edge-Dominated Graphs
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-010-9442-9openalex-snapshot
Complexity of Finding Graph Roots with Girth Conditions
inferred← citeshttps://doi.org/10.1007/s00453-023-01144-wopenalex-snapshot
On the d-Claw Vertex Deletion Problem
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-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/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/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.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/0020-0190(95)94093-8openalex-snapshot
Edge domination on bipartite permutation graphs and cotriangulated graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.04.004openalex-snapshot
Approximating dominating set on intersection graphs of rectangles and L -frames
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.002openalex-snapshot
The stable marriage problem with master preference lists
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.2020.05.030openalex-snapshot
Domination versus edge domination
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.disc.2020.112243openalex-snapshot
Bounding and approximating minimum maximal matchings in regular graphs
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.entcs.2003.12.005openalex-snapshot
Small Edge Dominating Sets of Regular Graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.09.012openalex-snapshot
Inapproximability of the kidney exchange problem
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.2011.09.007openalex-snapshot
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
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.jda.2008.07.003openalex-snapshot
Student-Project Allocation with preferences over Projects
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.tcs.2007.06.009openalex-snapshot
Approximability of the capacitated b -edge dominating set problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.047openalex-snapshot
Approximation algorithms for partially covering with edges
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.001openalex-snapshot
Approximating edge dominating set in dense graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.08.005openalex-snapshot
On the algorithmic complexity of edge total domination
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.015openalex-snapshot
Parameterized algorithms for stable matching with ties and incomplete lists
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.030openalex-snapshot
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.038openalex-snapshot
Algorithmic aspects of upper edge domination
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114270openalex-snapshot
Algorithms and hardness results for edge total domination problem in graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00356-1openalex-snapshot
Using maximality and minimality conditions to construct inequality chains
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00138-7openalex-snapshot
On approximability of the independent/connected edge dominating set problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00169-0openalex-snapshot
A natural family of optimization problems with arbitrarily small approximation thresholds
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00383-8openalex-snapshot
A 2-approximation algorithm for the minimum weight edge dominating set problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00147-4openalex-snapshot
On the algorithmic complexity of twelve covering and independence parameters of graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00159-6openalex-snapshot
Algorithmic aspects of clique-transversal and clique-independent sets
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00206-7openalex-snapshot
Hard variants of stable marriage
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00321-9openalex-snapshot
Approximability results for stable marriage problems with ties
inferred← citeshttps://doi.org/10.1023/a:1011445210568openalex-snapshot
A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
inferred← citeshttps://doi.org/10.1080/00207160.2013.818668openalex-snapshot
Maximal matching and edge domination in complete multipartite graphs
inferred← citeshttps://doi.org/10.1080/00207160.2013.853052openalex-snapshot
Hardness and approximation of minimum maximal matchings
inferred← citeshttps://doi.org/10.1080/00207160.2015.1080356openalex-snapshot
On the complexity of variations of mixed domination on graphs†
inferred← citeshttps://doi.org/10.1080/10556788.2015.1104679openalex-snapshot
Maximal matching polytope in trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxv102openalex-snapshot
Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs
inferred← citeshttps://doi.org/10.1134/s1064226921130040openalex-snapshot
Note on Dominating Set Problems
inferred← citeshttps://doi.org/10.1142/8591openalex-snapshot
Algorithmics of Matching Under Preferences
inferred← citeshttps://doi.org/10.1155/2022/3375246openalex-snapshot
On a Conjecture about the Saturation Number of Corona Product of Graphs
inferred← citeshttps://doi.org/10.1287/moor.2014.0707openalex-snapshot
The Complexity of Computing the Random Priority Allocation Matrix
inferred← citeshttps://doi.org/10.12988/imf.2007.07029openalex-snapshot
Independent edge dominating set of certain graphs
inferred← citeshttps://doi.org/10.13140/rg.2.2.34919.68006openalex-snapshot
On combinatorial optimization for dominating sets (literature survey, new models)
inferred← citeshttps://doi.org/10.15672/hujms.1095437openalex-snapshot
Smallest maximal matchings of graphs
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25692openalex-snapshot
Complexity of Probabilistic Inference in Random Dichotomous Hedonic Games
inferred← citeshttps://doi.org/10.37094/adyujsci.540858openalex-snapshot
Valid Inequalities for the Maximal Matching Polytope
inferred← citeshttps://doi.org/10.37236/449openalex-snapshot
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs
inferred← citeshttps://doi.org/10.37236/9963openalex-snapshot
Minimum Maximal Matchings in Cubic Graphs
inferred← citeshttps://doi.org/10.4067/s0716-09172015000100001openalex-snapshot
Complementary nil vertex edge dominating sets
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.361openalex-snapshot
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1827openalex-snapshot
Computing Graph Roots Without Short Cycles
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2022.31openalex-snapshot
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties
inferred← citeshttps://doi.org/10.46298/dmtcs.5378openalex-snapshot
New Results on Directed Edge Dominating Set
inferred← citeshttps://doi.org/10.46298/dmtcs.606openalex-snapshot
A note on the NP-hardness of two matching problems in induced subgrids
inferred← citeshttps://doi.org/10.46793/match.96-3.33925openalex-snapshot
Minimum Maximal Matchings in Phenylene Chains
inferred← citeshttps://doi.org/10.47749/t/unicamp.2014.932011openalex-snapshot
Problemas de emparelhamentos estáveis
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2197openalex-snapshot
Sandwiching saturation number of fullerene graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02956openalex-snapshot
Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2006.15905openalex-snapshot
Expected Outcomes and Manipulations in Online Fair Division
inferred← citeshttps://doi.org/10.48550/arxiv.2302.11902openalex-snapshot
On price-induced minmax matchings
inferred← citeshttps://doi.org/10.5539/cis.v9n1p21openalex-snapshot
On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching
inferred← citeshttps://doi.org/10.5555/1070432.1070470openalex-snapshot
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
inferred← citeshttps://doi.org/10.5555/2484920.2484968openalex-snapshot
Stable marriage and roommate problems with individual-based stability
inferred← citeshttps://doi.org/10.65109/jrob3640openalex-snapshot
Stable marriage and roommate problems with individual-based stability
inferred← citeshttps://doi.org/10.70675/80f73784z475az47adzb2ccz764d88c268e2openalex-snapshot
Contributions to approximation and parameterization in combinatorial optimization
inferred← citeshttps://doi.org/10.7155/jgaa.00123openalex-snapshot
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
inferred← citeshttps://doi.org/10.7282/t3-3zq1-0b23openalex-snapshot
Pricing problems in online markets
inferred← citeshttps://doi.org/10.7916/d8348jj5openalex-snapshot
Design and Analysis of Matching and Auction Markets
inferred← citeshttps://doi.org/10.82444/warw.33642091openalex-snapshot
Randomised techniques in combinatorial algorithmics
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.