default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th LATIN 2024: Puerto Varas, Chile - Part II
- José A. Soto
, Andreas Wiese:
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14579, Springer 2024, ISBN 978-3-031-55600-5
Combinatorics and Graph Theory
- Yixin Cao, Haowei Chen, Shenghua Wang:
Self-complementary (Pseudo-)Split Graphs. 3-18 - Christian Ortlieb:
Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs. 19-30 - Pavol Hell, Akbar Rafiey, Arash Rafiey:
Bi-arc Digraphs: Recognition Algorithm and Applications. 31-45 - Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki:
Pebbling in Kneser Graphs. 46-60 - Duncan Adamson, Nathan Flaherty, Igor Potapov, Paul G. Spirakis:
Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs. 61-76 - Marcelo Garlet Milani:
Directed Ear Anonymity. 77-97 - Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala:
Separating Path Systems in Complete Graphs. 98-113 - Alexander Kozachinskiy:
Infinite Separation Between General and Chromatic Memory. 114-128
Parameterized Algorithms
- Pallavi Jain, Manveer Singh Rathore:
Sparsity in Covering Solutions. 131-146 - Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza:
Induced Tree Covering and the Generalized Yutsis Property. 147-161 - Palash Dey, Sudeshna Kolay, Sipra Singh:
Knapsack: Connectedness, Path, and Shortest-Path. 162-176 - Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Algorithms for Weighted Vertex Cover. 177-192 - Shubhada Aute, Fahad Panolan:
Parameterized Algorithms for Minimum Sum Vertex Cover. 193-207 - Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu:
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. 208-222 - Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana:
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. 223-237
Automata Theory and Formal Languages
- Volker Turau:
Counting Fixed Points and Pure 2-Cycles of Tree Cellular Automata. 241-256 - Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. 257-271 - Isabel Donoso Leiva, Eric Goles, Martín Ríos-Wilson, Sylvain Sené:
Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular Automata. 272-286
Game Theory and Fairness
- Arnab Maiti, Palash Dey:
On Binary Networked Public Goods Game with Altruism. 289-303 - Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Proportional Fairness for Combinatorial Optimization. 304-319 - Matthias Hoffjan, Anna Maria Kerkmann, Jörg Rothe:
Core Stability in Altruistic Coalition Formation Games. 320-333 - Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. 334-347
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-12 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
