Small k-Dominating Sets in Planar Graphs with Applications

No abstract is available for this paper.

• Publication year

  2001

• Venue

  International Workshop on Graph-Theoretic Concepts in Computer Science

• Publication date

  2001-06-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-45477-2_19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximate Distance Labeling Schemes

  2001cited by this paper
• A survey on interval routing

  2000cited by this paper
• Conceptual Graphs and First Order Logic

  2000cited by this paper
• The Compactness of Interval Routing

  1999cited by this paper
• Some Results on the Space Requirement of Interval Routing

  1999cited by this paper
• Diameter and Treewidth in Minor-Closed Graph Families

  1999cited by this paper
• On the Dilation of Interval Routing

  1997cited by this paper
• The Complexity of Shortest Path and Dilation Bounded Interval Routing

  1997cited by this paper
• An Optimal Lower Bound for Interval Routing in General Networks

  1997cited by this paper
• Graph Minors: XV. Giant Steps

  1996cited by this paper
• Domination numbers of planar graphs

  1996cited by this paper
• Treewidth

  1994cited by this paper
• Interval Routing

  1987cited by this paper
• Graph Minors. II. Algorithmic Aspects of Tree-Width

  1986cited by this paper
• Labelling and Implicit Routing in Networks

  1985influential reference
• On the ratio of optimal integral and fractional covers

  1975cited by this paper

• Distributed Domination on Graph Classes of Bounded Expansion

  2017cites this paper
• Optimal dynamic program for r-domination problems over tree decompositions

  2015cites this paper
• VC-dimension and Erdős-Pósa property

  2014cites this paper
• Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls

  2014influential citation
• Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls

  2014influential citation
• The Degree/Diameter Problem in Maximal Planar Bipartite graphs

  2014cites this paper
• Hitting sets: VC-dimension and Multicut. (Hitting sets: VC-dimension et Multicut)

  2013cites this paper
• The Degree-Diameter Problem for Sparse Graph Classes

  2013cites this paper
• Augmenting Outerplanar Graphs to Meet Diameter Requirements

  2012cites this paper
• Problems from CGCS Luminy, May 2007

  2010cites this paper
• The Bidimensionality Theory and Its Algorithmic Applications

  2008cites this paper
• Incremental Optimization

  2008cites this paper
• Covering Planar Graphs with a Fixed Number of Balls

  2007influential citation
• Algorithmes de couverture et d'augmentation de graphes sous contraintes de distance

  2007cites this paper
• Incremental Algorithms: Solving Problems in a Changing World

  2007cites this paper
• INCREMENTAL ALGORITHMS: SOLVING PROBLEMS

  2007cites this paper
• An Incremental Model for Combinatorial Minimization

  2006cites this paper
• Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

  2005influential citation
• An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques

  2005cites this paper
• New bounds for multi-label interval routing

  2004influential citation
• Det-extremal cubic bipartite graphs

  2003cites this paper
• Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs

  2003cites this paper
• On covering bridged plane triangulations with balls

  2003cites this paper