Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18–22, 2024. Proceedings. Part II. (English) Zbl 1539.68038
Lecture Notes in Computer Science 14579. Cham: Springer (ISBN 978-3-031-55600-5/pbk; 978-3-031-55601-2/ebook). xix, 350 p. (2024).
Show indexed articles as search result.
The articles of this volume will be reviewed individually. For the preceding symposium see [Zbl 1515.68030]. For Part I of the proceedings of the present symposium see [Zbl 1539.68037].Indexed articles:
Cao, Yixin; Chen, Haowei; Wang, Shenghua, Self-complementary (pseudo-)split graphs, 3-18 [Zbl 07857859]
Ortlieb, Christian, Schnyder Woods and long induced paths in 3-connected planar graphs, 19-30 [Zbl 07857860]
Hell, Pavol; Rafiey, Akbar; Rafiey, Arash, Bi-arc digraphs: recognition algorithm and applications, 31-45 [Zbl 07857861]
Adauto, Matheus; Bardenova, Viktoriya; da Cruz, Mariana; de Figueiredo, Celina; Hurlbert, Glenn; Sasaki, Diana, Pebbling in Kneser graphs, 46-60 [Zbl 07857862]
Adamson, Duncan; Flaherty, Nathan; Potapov, Igor; Spirakis, Paul G., Structural and combinatorial properties of 2-swap word permutation graphs, 61-76 [Zbl 07857863]
Milani, Marcelo Garlet, Directed ear anonymity, 77-97 [Zbl 07857864]
Fernandes, Cristina G.; Oliveira Mota, Guilherme; Sanhueza-Matamala, Nicolás, Separating path systems in complete graphs, 98-113 [Zbl 07857865]
Kozachinskiy, Alexander, Infinite separation between general and chromatic memory, 114-128 [Zbl 07857866]
Jain, Pallavi; Rathore, Manveer Singh, Sparsity in covering solutions, 131-146 [Zbl 07857867]
Cunha, Luís; Duarte, Gabriel; Protti, Fábio; Nogueira, Loana; Souza, Uéverton, Induced tree covering and the generalized Yutsis property, 147-161 [Zbl 07857868]
Dey, Palash; Kolay, Sudeshna; Singh, Sipra, Knapsack: connectedness, path, and shortest-path, 162-176 [Zbl 07857869]
Mandal, Soumen; Misra, Pranabendu; Rai, Ashutosh; Saurabh, Saket, Parameterized approximation algorithms for weighted vertex cover, 177-192 [Zbl 07857870]
Aute, Shubhada; Panolan, Fahad, Parameterized algorithms for minimum sum vertex cover, 193-207 [Zbl 07857871]
Agrawal, Akanksha; Jana, Satyabrata; Sahu, Abhishek, A polynomial kernel for proper Helly circular-arc vertex deletion, 208-222 [Zbl 07857872]
Jain, Pallavi; Kanesh, Lawqueen; Panolan, Fahad; Saha, Souvik; Sahu, Abhishek; Saurabh, Saket; Upasana, Anannya, Max-SAT with cardinality constraint parameterized by the number of clauses, 223-237 [Zbl 07857873]
Turau, Volker, Counting fixed points and pure 2-cycles of tree cellular automata, 241-256 [Zbl 07857874]
Brihaye, Thomas; Pinchinat, Sophie; Terefenko, Alexandre, Semantics of attack-defense trees for dynamic countermeasures and a new hierarchy of star-free languages, 257-271 [Zbl 07857875]
Donoso Leiva, Isabel; Goles, Eric; Ríos-Wilson, Martín; Sené, Sylvain, Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata, 272-286 [Zbl 07857876]
Maiti, Arnab; Dey, Palash, On binary networked public goods game with altruism, 289-303 [Zbl 07857877]
Nguyen, Minh Hieu; Baiou, Mourad; Nguyen, Viet Hung; Vo, Thi Quynh Trang, Proportional fairness for combinatorial optimization, 304-319 [Zbl 07857878]
Hoffjan, Matthias; Kerkmann, Anna Maria; Rothe, Jörg, Core stability in altruistic coalition formation games, 320-333 [Zbl 07857879]
Bérczi, Kristóf; Mendoza-Cadena, Lydia Mirabel; Varga, Kitti, Newton-type algorithms for inverse optimization: weighted span objective, 334-347 [Zbl 07857880]
MSC:
68-06 | Proceedings, conferences, collections, etc. pertaining to computer science |
68Qxx | Theory of computing |
68Rxx | Discrete mathematics in relation to computer science |
68Wxx | Algorithms in computer science |
00B25 | Proceedings of conferences of miscellaneous specific interest |