On the public citation graph

Measure and Conquer: Domination – A Case Study

0 signed · 153 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.1006/jagm.2000.1075openalex-snapshot
New Upper Bounds for Maximum Satisfiability
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-36478-1openalex-snapshot
Combinatorial Optimization — Eureka, You Shrink!
inferredcites →https://doi.org/10.1007/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_10openalex-snapshot
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_101openalex-snapshot
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_49openalex-snapshot
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_21openalex-snapshot
Exact (Exponential) Algorithms for the Dominating Set Problem
inferredcites →https://doi.org/10.1007/s10817-005-9006-xopenalex-snapshot
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
inferredcites →https://doi.org/10.1016/0020-0190(76)90065-xopenalex-snapshot
A note on the complexity of the chromatic number problem
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferredcites →https://doi.org/10.1016/j.jda.2005.03.002openalex-snapshot
A note on the complexity of minimum dominating set
inferredcites →https://doi.org/10.1016/j.orl.2004.03.002openalex-snapshot
Enumerating maximal independent sets with applications to graph colouring
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferredcites →https://doi.org/10.1016/s0304-3975(01)00174-8openalex-snapshot
A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/s0963548300002042openalex-snapshot
Paths, Stars and the Number Three
inferredcites →https://doi.org/10.1109/sfcs.1995.492575openalex-snapshot
3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm
inferredcites →https://doi.org/10.1109/sfcs.1998.743513openalex-snapshot
An improved exponential-time algorithm for k-SAT
inferredcites →https://doi.org/10.1109/sffcs.1999.814612openalex-snapshot
A probabilistic algorithm for k-SAT and constraint satisfaction problems
inferredcites →https://doi.org/10.1109/tc.1986.1676847openalex-snapshot
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1137/0206038openalex-snapshot
Finding a Maximum Independent Set
inferredcites →https://doi.org/10.1137/050643350openalex-snapshot
Exact Algorithms for Treewidth and Minimum Fill-In
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.48550/arxiv.cs/0009006openalex-snapshot
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction
inferredcites →https://doi.org/10.48550/arxiv.cs/0304018openalex-snapshot
Quasiconvex Analysis of Backtracking Algorithms
inferredcites →https://doi.org/10.5555/338219.338244openalex-snapshot
A lower bound for DLL algorithms for k-SAT (preliminary version)

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470611098.ch8openalex-snapshot
Worst‐case Complexity of Exact Algorithms forNP‐hard Problems
inferred← citeshttps://doi.org/10.1007/11602613_58openalex-snapshot
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach
inferred← citeshttps://doi.org/10.1007/11602613_69openalex-snapshot
Computing Optimal Solutions for the min 3-set covering Problem
inferred← citeshttps://doi.org/10.1007/11611257_21openalex-snapshot
nonblocker: Parameterized Algorithmics for minimum dominating set
inferred← citeshttps://doi.org/10.1007/11672142_46openalex-snapshot
A Faster Algorithm for the Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/11758471_32openalex-snapshot
Parameterized Algorithms for Hitting Set: The Weighted Case
inferred← citeshttps://doi.org/10.1007/11785293_16openalex-snapshot
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
inferred← citeshttps://doi.org/10.1007/11785293_17openalex-snapshot
Exact Computation of Maximum Induced Forest
inferred← citeshttps://doi.org/10.1007/11847250_12openalex-snapshot
An Exact Algorithm for the Minimum Dominating Clique Problem
inferred← citeshttps://doi.org/10.1007/11889205_2openalex-snapshot
Algorithms and Constraint Programming
inferred← citeshttps://doi.org/10.1007/11917496_8openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
inferred← citeshttps://doi.org/10.1007/11917496_9openalex-snapshot
Improved Edge-Coloring with Three Colors
inferred← citeshttps://doi.org/10.1007/11940128_45openalex-snapshot
Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
inferred← citeshttps://doi.org/10.1007/11940128_60openalex-snapshot
Intuitive Algorithms and t-Vertex Cover
inferred← citeshttps://doi.org/10.1007/11944836_16openalex-snapshot
Solving Connected Dominating Set Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_30openalex-snapshot
Kernelization Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_6openalex-snapshot
Iterative Compression, and Measure and Conquer, for Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-5134-1_1openalex-snapshot
Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_132openalex-snapshot
Exact Algorithms for Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_5openalex-snapshot
Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_18openalex-snapshot
Counting Minimum Weighted Dominating Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_46openalex-snapshot
Exact Algorithms for L(2,1)-Labeling of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_14openalex-snapshot
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_42openalex-snapshot
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
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-87744-8_36openalex-snapshot
Faster Steiner Tree Computation in Polynomial-Space
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_15openalex-snapshot
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_16openalex-snapshot
On Independent Sets and Bicliques in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_50openalex-snapshot
Inclusion/Exclusion Meets Measure and Conquer
inferred← citeshttps://doi.org/10.1007/978-3-642-04500-4_8openalex-snapshot
Exponentialzeit-Algorithmen für TSP und DNP
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_122openalex-snapshot
On Partitioning a Graph into Two Connected Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_3openalex-snapshot
Exact Algorithms for Dominating Clique Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_24openalex-snapshot
Even Faster Algorithm for Set Splitting!
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_15openalex-snapshot
A Hybrid Graph Representation for Recursive Backtracking Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-16533-7openalex-snapshot
Exact Exponential Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-16533-7_6openalex-snapshot
Measure & Conquer
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-20877-5_9openalex-snapshot
Fast Exact Algorithm for L(2,1)-Labeling of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_21openalex-snapshot
Counting Independent Sets in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_132-2openalex-snapshot
Exact Algorithms for Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_4openalex-snapshot
A Faster Algorithm for Dominating Set Analyzed by the Potential Method
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-38236-9_10openalex-snapshot
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_1openalex-snapshot
Planar Induced Subgraphs of Sparse Graphs
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-007-9145-zopenalex-snapshot
Solving Connected Dominating Set Faster than 2 n
inferred← citeshttps://doi.org/10.1007/s00453-007-9149-8openalex-snapshot
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
inferred← citeshttps://doi.org/10.1007/s00453-007-9152-0openalex-snapshot
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-008-9199-6openalex-snapshot
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
inferred← citeshttps://doi.org/10.1007/s00453-009-9302-7openalex-snapshot
Exact Algorithms for L(2,1)-Labeling of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9418-9openalex-snapshot
Branch and Recharge: Exact Algorithms for Generalized Domination
inferred← citeshttps://doi.org/10.1007/s00453-010-9474-1openalex-snapshot
On Independent Sets and Bicliques in Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9546-xopenalex-snapshot
Exact Algorithms for Edge Domination
inferred← citeshttps://doi.org/10.1007/s00453-012-9612-zopenalex-snapshot
Computing Optimal Steiner Trees in Polynomial Space
inferred← citeshttps://doi.org/10.1007/s00453-013-9759-2openalex-snapshot
Inclusion/Exclusion Meets Measure and Conquer
inferred← citeshttps://doi.org/10.1007/s00453-015-9970-4openalex-snapshot
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
inferred← citeshttps://doi.org/10.1007/s10288-015-0294-7openalex-snapshot
When polynomial approximation meets exact computation
inferred← citeshttps://doi.org/10.1007/s10479-018-2986-9openalex-snapshot
When polynomial approximation meets exact computation
inferred← citeshttps://doi.org/10.1007/s10796-018-9890-3openalex-snapshot
A Fast Exact Algorithm for Deployment of Sensor Nodes for Internet of Things
inferred← citeshttps://doi.org/10.1007/s12351-008-0020-8openalex-snapshot
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s13042-011-0043-yopenalex-snapshot
Simulated annealing with stochastic local search for minimum dominating set problem
inferred← citeshttps://doi.org/10.1007/s41095-015-0030-4openalex-snapshot
Inexact graph matching using a hierarchy of matching processes
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.035openalex-snapshot
Efficiency in exponential time for domination-type problems
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.009openalex-snapshot
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.10.012openalex-snapshot
Pathwidth of cubic graphs and exact algorithms
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.08.010openalex-snapshot
An improved exact algorithm for the domatic number problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.014openalex-snapshot
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.009openalex-snapshot
Finding a dominating set on bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.010openalex-snapshot
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
inferred← citeshttps://doi.org/10.1016/j.jda.2008.07.004openalex-snapshot
A bounded search tree algorithm for parameterized face cover
inferred← citeshttps://doi.org/10.1016/j.jda.2011.03.006openalex-snapshot
An exact algorithm for connected red–blue dominating set
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.07.006openalex-snapshot
On scalable parallel recursive backtracking
inferred← citeshttps://doi.org/10.1016/j.orl.2006.02.004openalex-snapshot
Improved worst-case complexity for the MIN 3-SET COVERING problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.014openalex-snapshot
An exact algorithm for the minimum dominating clique problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.005openalex-snapshot
Improved edge-coloring with three colors
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.001openalex-snapshot
Parameterized algorithms for d -Hitting Set: The weighted case
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.026openalex-snapshot
Improved upper bounds for vertex cover
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.001openalex-snapshot
On partitioning a graph into two connected subgraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.037openalex-snapshot
Fast exact algorithm for L(2,1) -labeling of graphs
inferred← citeshttps://doi.org/10.1080/00207160903176868openalex-snapshot
Parameterized algorithmics for d-H itting S et
inferred← citeshttps://doi.org/10.1088/1674-1056/ad02e5openalex-snapshot
Quantum algorithm for minimum dominating set problem with circuit design
inferred← citeshttps://doi.org/10.1109/csicc52343.2021.9420625openalex-snapshot
Solving Minimum Dominating Set in Multiplex Networks Using Learning Automata
inferred← citeshttps://doi.org/10.1109/cso.2010.240openalex-snapshot
An Exact Fast Algorithm for Minimum Hitting Set
inferred← citeshttps://doi.org/10.1109/iceoe.2011.6013331openalex-snapshot
A query optimization algorithm of database based on layered backtracking
inferred← citeshttps://doi.org/10.1109/ictta.2006.1684854openalex-snapshot
An Improved Exact Algorithm for the Domatic Number Problem
inferred← citeshttps://doi.org/10.1109/milcom.2010.5680135openalex-snapshot
Efficient broadcasting in tactical networks: Forwarding vs. network coding
inferred← citeshttps://doi.org/10.1109/pdcat.2012.16openalex-snapshot
A Decentralized Load Balancing Approach for Parallel Search-Tree Optimization
inferred← citeshttps://doi.org/10.1109/transai49837.2020.00021openalex-snapshot
Semi-Exact Exponential-Time Algorithms: an Experimental Study
inferred← citeshttps://doi.org/10.1109/tsmc.2020.2987163openalex-snapshot
Minimum Dominating Set of Multiplex Networks: Definition, Application, and Identification
inferred← citeshttps://doi.org/10.1137/050643350openalex-snapshot
Exact Algorithms for Treewidth and Minimum Fill-In
inferred← citeshttps://doi.org/10.1137/1.9781611973068.67openalex-snapshot
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
inferred← citeshttps://doi.org/10.1142/9789812770998_0010openalex-snapshot
COMPUTING MINIMUM DIRECTED FEEDBACK VERTEX SET IN O*(1.9977n)
inferred← citeshttps://doi.org/10.1145/1435375.1435384openalex-snapshot
Combinatorial bounds via measure and conquer
inferred← citeshttps://doi.org/10.1145/1466390.1466401openalex-snapshot
Applying practice to theory
inferred← citeshttps://doi.org/10.1145/1552285.1552286openalex-snapshot
A measure & conquer approach for the analysis of exact algorithms
inferred← citeshttps://doi.org/10.1145/1644015.1644024openalex-snapshot
Exponential time algorithms for the minimum dominating set problem on some graph classes
inferred← citeshttps://doi.org/10.1145/2071379.2071387openalex-snapshot
Even Faster Exact Bandwidth
inferred← citeshttps://doi.org/10.1145/2914642.2914650openalex-snapshot
Resiliency Policies in Access Control Revisited
inferred← citeshttps://doi.org/10.11591/ij-ai.v2i4.3481openalex-snapshot
Memetic Algorithm for the Minimum Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1216/rmj-2018-48-7-2311openalex-snapshot
Dominating sets in intersection graphs of finite groups
inferred← citeshttps://doi.org/10.14569/ijarai.2013.020808openalex-snapshot
Memetic Algorithm with Filtering Scheme for the Minimum Weighted Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.408openalex-snapshot
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
inferred← citeshttps://doi.org/10.17148/iarjset.2015.2203openalex-snapshot
Survey of Algorithms on Maximum Clique Problem
inferred← citeshttps://doi.org/10.3390/ijgi11010019openalex-snapshot
Query Processing of Geosocial Data in Location-Based Social Networks
inferred← citeshttps://doi.org/10.3390/math10040640openalex-snapshot
The Domatic Partition Problem in Separable Graphs
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.6openalex-snapshot
Exact Elimination of Cycles in Graphs
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2009.2326openalex-snapshot
A Fine-grained Analysis of a Simple Independent Set Algorithm
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1329openalex-snapshot
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
inferred← citeshttps://doi.org/10.46298/dmtcs.563openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2827openalex-snapshot
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.0909.4021openalex-snapshot
Beyond O*(2^n) in domination-type problems
inferred← citeshttps://doi.org/10.48550/arxiv.1009.1381openalex-snapshot
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.1312.7626openalex-snapshot
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6399openalex-snapshot
A Hybrid Graph Representation for Exact Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1712.02103openalex-snapshot
Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603060openalex-snapshot
An Improved Exact Algorithm for the Domatic Number Problem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0612028openalex-snapshot
Using Combinatorics to Prune Search Trees: Independent and Dominating Set
inferred← citeshttps://doi.org/10.5555/1109557.1109560openalex-snapshot
Measure and conquer: a simple O(20.288n) independent set algorithm
inferred← citeshttps://doi.org/10.5555/1496770.1496837openalex-snapshot
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
inferred← citeshttps://doi.org/10.70675/95201668z72d9z4728zb91fz19221d1dc6cfopenalex-snapshot
Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique
inferred← citeshttps://doi.org/10.7155/jgaa.00358openalex-snapshot
Planar Induced Subgraphs of Sparse Graphs
inferred← citeshttps://doi.org/10.7551/mitpress/11438.003.0011openalex-snapshot
And Everything In Between
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.