Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012, Proceedings > Computing Minimum Geodetic Sets of Proper Interval Graphs
LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012, Proceedings |
David Fernández-Baca
Springer Berlin Heidelberg
LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012, Proceedings
Computing Minimum Geodetic Sets of Proper Interval Graphs
Authors

Tınaz Ekim; Aysel Erey; Pinar Heggernes; Pim van ’t Hof; Daniel Meister

ARI Id

1665072269858_4713100

Access

Not Available Free

Pages

279-290

DOI

10.1007/978-3-642-29344-3_24

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-29344-3_24

Table of Contents of Book
Showing 1 to 20 of 57 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
A Generalization of the Convex Kakeya Problem
Hee-Kap Ahn; Sang Won Bae; Otfried Cheong; Joachim Gudmundsson; Takeshi Tokuyama; Antoine Vigneron
1-12
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines
Eric Angel; Evripidis Bampis; Vincent Chau
13-24
Bichromatic 2-Center of Pairs of Points
Esther M. Arkin; José Miguel Díaz-Báñez; Ferran Hurtado; Piyush Kumar; Joseph S. B. Mitchell; Belén Palop et al.
25-36
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar
37-48
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem
Rafael da Ponte Barbosa; Yoshiko Wakabayashi
49-60
On the Advice Complexity of the Knapsack Problem
Hans-Joachim Böckenhauer; Dennis Komm; Richard Královič; Peter Rossmanith
61-72
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
Nicolas Boria; Jérôme Monnot; Vangelis Th. Paschos
73-84
On Plane Constrained Bounded-Degree Spanners
Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot
85-96
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
Joshua Brody; Hongyu Liang; Xiaoming Sun
97-108
Density Classification on Infinite Lattices and Trees
Ana Bušić; Nazim Fatès; Jean Mairesse; Irène Marcovici
109-120
Coloring Planar Homothets and Three-Dimensional Hypergraphs
Jean Cardinal; Matias Korman
121-132
An Equivariance Theorem with Applications to Renaming
Armando Castañeda; Maurice Herlihy; Sergio Rajsbaum
133-144
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks
Armando Castañeda; Damien Imbs; Sergio Rajsbaum; Michel Raynal
145-156
Pseudorandomness of a Random Kronecker Sequence
Eda Cesaratto; Brigitte Vallée
157-171
Revisiting the Cache Miss Analysis of Multithreaded Algorithms
Richard Cole; Vijaya Ramachandran
172-183
Parameterized Complexity of MaxSat above Average
Robert Crowston; Gregory Gutin; Mark Jones; Venkatesh Raman; Saket Saurabh
184-194
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n
Marek Cygan; Marcin Pilipczuk; Michał Pilipczuk; Jakub Onufry Wojtaszczyk
195-206
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
Daniel Dadush
207-218
Two-Dimensional Range Diameter Queries
Pooya Davoodi; Michiel Smid; Freek van Walderveen
219-230
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 57 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings