- Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Split B_1 B 1 -EPG Graphs. LATIN 2018: 361-375 - Tamal K. Dey, Tianqi Li, Yusu Wang:
Efficient Algorithms for Computing a Minimal Homology Basis. LATIN 2018: 376-398 - Sergey Dovgal, Vlady Ravelomanana:
Shifting the Phase Transition Threshold for Random Graphs Using Degree Set Constraints. LATIN 2018: 399-412 - Philippe Duchon, Cyril Nicaud:
On the Biased Partial Word Collector Problem. LATIN 2018: 413-426 - Andrzej Dudek, Andrzej Rucinski:
Constructive Ramsey Numbers for Loose Hyperpaths. LATIN 2018: 427-436 - Matteo Dusefante, Riko Jacob:
Cache Oblivious Sparse Matrix Multiplication. LATIN 2018: 437-447 - David Eppstein, Michael T. Goodrich, Nil Mamano:
Reactive Proximity Data Structures for Graphs. LATIN 2018: 777-789 - Carsten Fischer, Heiko Röglin:
Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering. LATIN 2018: 461-474 - Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan:
Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN 2018: 475-489 - Travis Gagie, Gonzalo Navarro, Nicola Prezza:
On the Approximation Ratio of Lempel-Ziv Parsing. LATIN 2018: 490-503 - Hang Gao, Wenyu Gao:
Kernelization for Maximum Happy Vertices Problem. LATIN 2018: 504-514 - Bernd Gärtner, Ahad N. Zehmakan:
Majority Model on Random Regular Graphs. LATIN 2018: 572-583 - Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele:
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN 2018: 515-528 - Loukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis:
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs. LATIN 2018: 529-543 - Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN 2018: 544-557 - Juan Gutiérrez:
Transversals of Longest Cycles in Chordal and Bounded Tree-Width Graphs. LATIN 2018: 558-571 - Jie Han, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni:
Property Testing for Point Sets on the Plane. LATIN 2018: 584-596 - Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Plane Gossip: Approximating Rumor Spread in Planar Graphs. LATIN 2018: 611-624 - Adalat Jabrayilov, Petra Mutzel:
New Integer Linear Programming Models for the Vertex Coloring Problem. LATIN 2018: 640-652 - Yasushi Kawase, Hanna Sumita, Takuro Fukunaga:
Submodular Maximization with Uncertain Knapsack Capacity. LATIN 2018: 653-668 - Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time. LATIN 2018: 669-682 - Katharina Klost, Wolfgang Mulzer:
Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors. LATIN 2018: 683-696 - Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game. LATIN 2018: 697-711 - Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Satisfying Neighbor Preferences on a Circle. LATIN 2018: 727-740 - Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Two-Dimensional Knapsack for Circles. LATIN 2018: 741-754 - Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Mutants and Residents with Different Connection Graphs in the Moran Process. LATIN 2018: 790-804 - Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms:
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs. LATIN 2018: 805-819 - Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of k-Class Biased Permutations. LATIN 2018: 820-834 - Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, Ahad N. Zehmakan:
Transition Operations over Plane Trees. LATIN 2018: 835-848