LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642544224, 9783642544231

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Integrated Supply Chain Management via Randomized Rounding

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_49 ◽

2014 ◽

pp. 562-573 ◽

Cited By ~ 1

Author(s):

Lehilton L. C. Pedrosa ◽

Maxim Sviridenko

Keyword(s):

Supply Chain ◽

Supply Chain Management ◽

Randomized Rounding ◽

Chain Management ◽

Integrated Supply Chain

Download Full-text

Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_41 ◽

2014 ◽

pp. 466-477 ◽

Cited By ~ 1

Author(s):

Antoine Genitrini ◽

Cécile Mailler

Keyword(s):

Equivalence Classes ◽

Satisfiability Problem

Download Full-text

Linear Grammars with One-Sided Contexts and Their Automaton Representation

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_17 ◽

2014 ◽

pp. 190-201 ◽

Cited By ~ 3

Author(s):

Mikhail Barash ◽

Alexander Okhotin

Download Full-text

Relatively Bridge-Addable Classes of Graphs

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_34 ◽

2014 ◽

pp. 391-398 ◽

Cited By ~ 1

Author(s):

Colin McDiarmid ◽

Kerstin Weller

Download Full-text

Budget Feasible Mechanisms for Experimental Design

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_62 ◽

2014 ◽

pp. 719-730 ◽

Cited By ~ 9

Author(s):

Thibaut Horel ◽

Stratis Ioannidis ◽

S. Muthukrishnan

Keyword(s):

Experimental Design ◽

Budget Feasible

Download Full-text

A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_7 ◽

2014 ◽

pp. 72-83 ◽

Cited By ~ 1

Author(s):

Martin Fürer

Keyword(s):

Natural Generalization ◽

Tree Width

Download Full-text

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_4 ◽

2014 ◽

pp. 35-46 ◽

Cited By ~ 2

Author(s):

José R. Correa ◽

Laurent Feuilloley ◽

José A. Soto

Keyword(s):

Hitting Sets ◽

Diagonal Line

Download Full-text

Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_20 ◽

2014 ◽

pp. 226-237 ◽

Cited By ~ 1

Author(s):

Tong-Wook Shinn ◽

Tadao Takaoka

Keyword(s):

Shortest Paths ◽

All Pairs Shortest Paths ◽

Bottleneck Paths

Download Full-text

Computing the Degeneracy of Large Graphs

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_22 ◽

2014 ◽

pp. 250-260 ◽

Cited By ~ 7

Author(s):

Martín Farach-Colton ◽

Meng-Tsung Tsai

Keyword(s):

Large Graphs

Download Full-text

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-54423-1_26 ◽

2014 ◽

pp. 294-305 ◽

Cited By ~ 6

Author(s):

Stephane Durocher ◽

Omrit Filtser ◽

Robert Fraser ◽

Ali D. Mehrabi ◽

Saeed Mehrabi

Keyword(s):

Approximation Algorithm ◽

Art Galleries

Download Full-text

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Integrated Supply Chain Management via Randomized Rounding

Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem

Linear Grammars with One-Sided Contexts and Their Automaton Representation

Relatively Bridge-Addable Classes of Graphs

Budget Feasible Mechanisms for Experimental Design

A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width

Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line

Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems

Computing the Degeneracy of Large Graphs

A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras

LATIN 2014: Theoretical Informatics - Lecture Notes in Computer Science
Latest Publications