default search action
11th LAGOS 2021: Online Event / São Paulo, Brazil
- Carlos E. Ferreira, Orlando Lee, Flávio Keidi Miyazawa:
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021. Procedia Computer Science 195, Elsevier 2021 - Preface. 5-11
- Jordan Barrett, Salomon Bendayan, Yanjia Li, Bruce A. Reed:
Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack. 12-20 - Klairton Lima Brito
, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias
Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions. 21-29 - Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle:
Treelength of Series-parallel Graphs. 30-38 - Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado:
On the Inapproximability of the Cable-Trench Problem. 39-48 - Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa:
An efficient parameterized approximation scheme for the Star k-Hub Center. 49-58 - Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos:
Kernelization results for Equitable Coloring. 59-67 - Márcia R. Cappelle, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos:
Parameterized algorithms for locating-dominating sets. 68-76 - Guilherme C. M. Gomes, Vinícius Fernandes dos Santos:
On structural parameterizations of the selective coloring problem. 77-85 - Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
Target set selection with maximum activation time. 86-96 - Pierre Bergé, Michel Habib:
Diameter in linear time for constant-dimension median graphs. 97-107 - Lucas Böltz, Benjamin Becker, Hannes Frey:
Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. 108-117 - Vitor Tocci Ferreira de Luca, Fabiano de Souza Oliveira, Jayme Luiz Szwarcfiter:
Minimum Number of Bends of Paths of Trees in a Grid Embedding. 118-126 - Hessa Al-Thani, Jon Lee:
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks. 127-134 - Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. 135-144 - Daniel Chicayban Bastos, Luis Antonio Brasil Kowada:
How to detect whether Shor's algorithm succeeds against large integers without a quantum computer. 145-151 - Susanna F. de Rezende
Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard. 152-162 - Andrzej Lingas:
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. 163-171 - Ishay Haviv, Michal Parnas:
Upper Bounds on the Boolean Rank of Kronecker Products. 172-180 - Wilder P. Mendes, Simone Dantas, Sylvain Gravier:
The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles. 181-189 - Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Perfect Matching Game. 190-199 - Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Hamilton Cycle Game. 200-211 - Luérbio Faria, André Luiz Pires Guedes
On feedback vertex set in reducible flow hypergraphs. 212-220 - Flavia Bonomo-Braberman, Gastón Abel Brito:
Intersection models for 2-thin and proper 2-thin graphs. 221-229 - Marina Groshaus, André Luiz Pires Guedes
Biclique Graphs of K3-free Graphs and Bipartite Graphs. 230-238 - Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. 239-247 - Clément Dallard
Graphs with Two Moplexes. 248-256 - Adriana Hansberg, Amanda Montejano, Yair Caro:
Recursive constructions of amoebas. 257-265 - Adrián Pastine
On the diameter of Schrijver graphs. 266-274 - Bernardo M. Ábrego, Julia Dandurand, Silvia Fernández-Merchant
The crossing number of centrally symmetric complete geometric graphs. 275-279 - Léo Vieira Peres, Ricardo Dahab
Tutte's 3-flow Conjecture for almost even graphs. 280-288 - John M. Machacek
Unique maximum independent sets in graphs on monomials of a fixed degree. 289-297 - Roberta Rasoviti Marques Costa Moço, Alberto Alexandre Assis Miranda, Cândida Nunes da Silva:
The signature matrix for 6-Pfaffian graphs. 298-305 - Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total coloring the direct product of complete graphs. 306-314 - Mauro Nigro, Matheus Nunes Adauto, Diana Sasaki:
On total coloring of 4-regular circulant graphs. 315-324 - Luis Gustavo da Soledade Gonzaga
The chromatic index of split-interval graphs. 325-333 - Isabel F. A. Gonçalves
On equitable total coloring of snarks. 334-342 - Daniel A. Quiroz
Complete immersions in graphs with independence number two and small forbidden subgraphs. 343-349 - Simón Piga
Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs. 350-358 - Fábio Botler
The 2-Decomposition Conjecture for a new class of graphs. 359-367 - Maurício Collares Neto, Yoshiharu Kohayakawa
Constrained colourings of random graphs. 368-375 - Maurício Collares Neto, Yoshiharu Kohayakawa
Hitting times for arc-disjoint arborescences in random digraph processes. 376-384 - Fábio Botler
Counting orientations of graphs with no strongly connected tournaments. 385-393 - Peter Allen, Julia Böttcher
An Approximate Blow-up Lemma for Sparse Hypergraphs. 394-403 - Julia Böttcher
Cycle factors in randomly perturbed graphs. 404-411 - Sören Berger, Simón Piga
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. 412-418 - Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel
Maximum number of r-edge-colorings such that all copies of Kk are rainbow. 419-426 - Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
Cliques in exact distance powers of graphs of given maximum degree. 427-436 - Claudia J. F. Gonçalves, Emerson L. Monte Carmelo, Irene N. Nakaoka:
Polarity graphs and C4-free multipartite graphs. 437-444 - Laura Eslava
Survival for a Galton-Watson tree with cousin mergers. 445-452 - Pranshu Gupta, Yannick Mogge, Simón Piga
Maximum size of r-cross t-intersecting families. 453-458 - Javier T. Akagi, Eduardo A. Canale, Marcos Villagra:
Tromino Tilings with Pegs via Flow Networks. 459-467 - Antoine Genitrini, Martin Pépin
Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. 468-477 - Matheus Diógenes Andrade, Fábio Luiz Usberti:
Combinatorial Properties for the Green Vehicle Routing Problem. 478-488 - Felipe de Carvalho Pereira
Effective Heuristics for the Perfect Awareness Problem. 489-498 - Henrique Becker
Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem. 499-507 - Enrico Malaguti, Vagner Pedrotti:
A new formulation for the Weighted Safe Set Problem. 508-515 - Cecilia Lescano Osório, Edna Ayako Hoshino:
A branch-and-price algorithm for the ring/ring problem. 516-522 - Marcelo Bianchetti, Javier Marenco:
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem. 523-531 - Manuela Blaum, Javier Marenco:
Valid inequalities and complete characterizations of the 2-domination and the P3-hull number polytopes. 532-542
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-26 00:35 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: