Facet browsing currently unavailable
Page 10 of 4076 results
Sort by: relevance publication year
Approximation Schemes for Packing Problems with $$ell _p$$-norm Diversity Constraints BOOK CHAPTER published 2022 in LATIN 2022: Theoretical Informatics |
Piercing Pairwise Intersecting Convex Shapes in the Plane BOOK CHAPTER published 2022 in LATIN 2022: Theoretical Informatics |
Ordered Strip Packing BOOK CHAPTER published 2020 in LATIN 2020: Theoretical Informatics |
A decidability result about convex polyominoes BOOK CHAPTER published 1992 in LATIN '92 |
Reactive Proximity Data Structures for Graphs BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
Colouring graphs whose chromatic number is almost their maximum degree BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
On the relation between BDDs and FDDs BOOK CHAPTER published 1995 in LATIN '95: Theoretical Informatics |
Faster non-linear parametric search with applications to optimization and dynamic geometry BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
On the Complexity of Half-Guarding Monotone Polygons BOOK CHAPTER published 2022 in LATIN 2022: Theoretical Informatics |
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem BOOK CHAPTER published 2012 in LATIN 2012: Theoretical Informatics |
Scheduling on Power-Heterogeneous Processors BOOK CHAPTER published 2016 in LATIN 2016: Theoretical Informatics |
Equivalent Conditions for Regularity (Extended Abstract) BOOK CHAPTER published 2000 in Lecture Notes in Computer Science |
A linear time algorithm to recognize clustered planar graphs and its parallelization BOOK CHAPTER published 1998 in LATIN'98: Theoretical Informatics |
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs BOOK CHAPTER published 2000 in Lecture Notes in Computer Science |
Hardness of Variants of the Graph Coloring Game BOOK CHAPTER published 2020 in LATIN 2020: Theoretical Informatics |
On the Approximation Ratio of Lempel-Ziv Parsing BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
Two-Dimensional Knapsack for Circles BOOK CHAPTER published 2018 in LATIN 2018: Theoretical Informatics |
The Complexity Classes of Hamming Distance Recoverable Robust Problems BOOK CHAPTER published 2024 in Lecture Notes in Computer Science |
Decoding Tree Decompositions from Permutations BOOK CHAPTER published 2024 in Lecture Notes in Computer Science |
Self-complementary (Pseudo-)Split Graphs BOOK CHAPTER published 2024 in Lecture Notes in Computer Science |