default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. LATIN 2012: Arequipa, Peru
- David Fernández-Baca:
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Lecture Notes in Computer Science 7256, Springer 2012, ISBN 978-3-642-29343-6 - Hee-Kap Ahn
, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron:
A Generalization of the Convex Kakeya Problem. 1-12 - Eric Angel, Evripidis Bampis, Vincent Chau:
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. 13-24 - Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira:
Bichromatic 2-Center of Pairs of Points. 25-36 - Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. 37-48 - Rafael da Ponte Barbosa, Yoshiko Wakabayashi:
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. 49-60 - Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Advice Complexity of the Knapsack Problem. 61-72 - Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. 73-84 - Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. 85-96 - Joshua Brody, Hongyu Liang, Xiaoming Sun:
Space-Efficient Approximation Scheme for Circular Earth Mover Distance. 97-108 - Ana Busic, Nazim Fatès, Jean Mairesse, Irène Marcovici:
Density Classification on Infinite Lattices and Trees. 109-120 - Jean Cardinal, Matias Korman:
Coloring Planar Homothets and Three-Dimensional Hypergraphs. 121-132 - Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum:
An Equivariance Theorem with Applications to Renaming. 133-144 - Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. 145-156 - Eda Cesaratto, Brigitte Vallée:
Pseudorandomness of a Random Kronecker Sequence. 157-171 - Richard Cole, Vijaya Ramachandran:
Revisiting the Cache Miss Analysis of Multithreaded Algorithms. 172-183 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of MaxSat above Average. 184-194 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. 195-206 - Daniel Dadush:
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming. 207-218 - Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen:
Two-Dimensional Range Diameter Queries. 219-230 - Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski:
An Improved Upper Bound on the Density of Universal Random Graphs. 231-242 - Volker Diekert, Jonathan Kausch, Markus Lohrey:
Logspace Computations in Graph Groups and Coxeter Groups. 243-254 - Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho:
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. 255-266 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman:
On the Radon Number for P 3-Convexity. 267-278 - Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister:
Computing Minimum Geodetic Sets of Proper Interval Graphs. 279-290 - Zoltán Ésik, Szabolcs Iván:
Hausdorff Rank of Scattered Context-Free Linear Orders. 291-302 - Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks:
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. 303-314 - MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On the Non-progressive Spread of Influence through Social Networks. 315-326 - Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. 327-337 - Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek:
Structural Complexity of Multiobjective NP Search Problems. 338-349 - Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger:
k-Gap Interval Graphs. 350-361 - Pierre Fraigniaud, Andrzej Pelc:
Decidability Classes for Mobile Agents Computing. 362-374 - Bin Fu:
NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets. 375-386 - Martin Fürer:
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. 387-398 - Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio:
Indexed Multi-pattern Matching. 399-407 - Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh:
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. 408-419 - Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan, Rajmohan Rajaraman, Ravi Sundaram:
Cache Me If You Can: Capacitated Selfish Replication Games. 420-432 - Gero Greiner, Riko Jacob:
The Efficiency of MapReduce in Parallel External Memory. 433-445 - Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
Algorithms for Some H-Join Decompositions. 446-457 - Daniel Heldt, Kolja B. Knauer, Torsten Ueckerdt:
On the Bend-Number of Planar and Outerplanar Graphs. 458-469 - Ahmed Helmi, Conrado Martínez, Alois Panholzer:
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. 470-481 - Wiebke Höhn, Tobias Jacobs:
On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost. 482-493 - Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni:
Advantage of Overlapping Clusters for Minimizing Conductance. 494-505 - Toryn Qwyllyn Klassen, Philipp Woelfel:
Independence of Tabulation-Based Hash Classes. 506-517 - Martin Kutrib, Andreas Malcher, Giovanni Pighizzini:
Oblivious Two-Way Finite Automata: Decidability and Complexity. 518-529 - Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo:
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. 530-541 - Bernard Mans, Igor E. Shparlinski:
Random Walks and Bisections in Random Circulant Graphs. 542-555 - Monaldo Mastrolilli:
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. 556-567 - Basile Morcrette:
Fully Analyzing an Algebraic Pólya Urn Model. 568-581 - Zeev Nutov:
Degree-Constrained Node-Connectivity. 582-593 - Zeev Nutov:
Survivable Network Activation Problems. 594-605 - Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen:
On the Integrality Gap of the Subtour LP for the 1, 2-TSP. 606-617 - Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. 618-630 - Amir Shpilka:
Capacity Achieving Two-Write WOM Codes. 631-642 - Xiaoming Sun, Chengu Wang, Wei Yu:
The Relationship between Inner Product and Counting Cycles. 643-654 - Linqing Tang, Peng Zhang:
Approximating Minimum Label s-t Cut via Linear Programming. 655-666
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 2026-02-06 22:25 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:
