default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. LATIN 2014: Montevideo, Uruguay
- Alberto Pardo, Alfredo Viola:
LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings. Lecture Notes in Computer Science 8392, Springer 2014, ISBN 978-3-642-54422-4
Complexity 1
- Volker Diekert, Alexei G. Myasnikov
, Armin Weiß:
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. 1-12 - Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo:
Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3. 13-23 - Michael Lampis, Valia Mitsou:
The Computational Complexity of the Game of Set and Its Theoretical Applications. 24-34
Complexity 2
- José R. Correa, Laurent Feuilloley, José A. Soto:
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line. 35-46 - Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. 47-59 - Anja Rey, Jörg Rothe:
False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time. 60-71 - Martin Fürer:
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. 72-83
Computational Geometry 1
- Luis Barba, Prosenjit Bose, Stefan Langerman:
Optimal Algorithms for Constrained 1-Center Problems. 84-95 - Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. 96-107 - Prosenjit Bose, André van Renssen:
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. 108-119 - Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. 120-131
Graph Drawing
- Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
The Planar Slope Number of Subcubic Graphs. 132-143 - Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. 144-155 - Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. 156-167 - Luca Castelli Aleardi, Éric Fusy, Anatolii Kostrygin:
Periodic Planar Straight-Frame Drawings with Polynomial Resolution. 168-179
Automata
- Ines Klimann, Matthieu Picantin:
A Characterization of Those Automata That Structurally Generate Finite Groups. 180-189 - Mikhail Barash, Alexander Okhotin:
Linear Grammars with One-Sided Contexts and Their Automaton Representation. 190-201
Computability
- Edward Hermann Haeusler, Mauricio Ayala-Rincón:
On the Computability of Relations on λ-Terms and Rice's Theorem - The Case of the Expansion Problem for Explicit Substitutions. 202-213 - Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Computing in the Presence of Concurrent Solo Executions. 214-225
Algorithms on Graphs
- Tong-Wook Shinn, Tadao Takaoka:
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. 226-237 - Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. 238-249 - Martin Farach-Colton, Meng-Tsung Tsai:
Computing the Degeneracy of Large Graphs. 250-260
Computational Geometry 2
- Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. 261-272 - Sang-Sub Kim, Hee-Kap Ahn:
An Improved Data Stream Algorithm for Clustering. 273-284 - Ran Duan:
Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces. 285-293 - Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi:
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras. 294-305
Algorithms
- Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, Shubhangi Saraf:
Helly-Type Theorems in Property Testing. 306-317 - Matthias Englert, Nicolaos Matsakis, Marcin Mucha:
New Bounds for Online Packing LPs. 318-329 - Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. 330-341 - Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-Free Network Exploration. 342-354
Random Structures
- Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
Powers of Hamilton Cycles in Pseudorandom Graphs. 355-366 - Philippe Duchon, Romaric Duvignau:
Local Update Algorithms for Random Graphs. 367-378 - Felipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen:
Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle. 379-390 - Colin McDiarmid, Kerstin Weller:
Relatively Bridge-Addable Classes of Graphs. 391-398
Complexity on Graphs 1
- Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
O(n) Time Algorithms for Dominating Induced Matching Problems. 399-408 - Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. 409-420 - Marie Albenque, Kolja B. Knauer:
Convexity in Partial Cubes: The Hull Number. 421-432 - Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Simon Griffiths, Robert Morris, Leonardo Sampaio Rocha, Ana Silva:
Connected Greedy Colourings. 433-441
Analytic Combinatorics
- Julien Clément, Laura Giambruno:
On the Number of Prefix and Border Tables. 442-453 - Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba:
Probabilities of 2-Xor Functions. 454-465 - Antoine Genitrini, Cécile Mailler:
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem. 466-477
Analytic and Enumerative Combinatorics
- Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. 478-489 - Pawel Hitczenko, Svante Janson:
Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences. 490-501 - Nicolas Basset:
Counting and Generating Permutations Using Timed Languages. 502-513
Complexity on Graphs 2
- Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. 514-525 - Florent Foucaud, Reza Naserasr:
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. 526-537 - Pavol Hell, Shenwei Huang:
Complexity of Coloring Graphs without Paths and Cycles. 538-549
Approximation Algorithms
- Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Real-Time Scheduling on Identical Machines. 550-561 - Lehilton L. C. Pedrosa, Maxim Sviridenko:
Integrated Supply Chain Management via Randomized Rounding. 562-573 - Mário César San Felice, David P. Williamson, Orlando Lee:
The Online Connected Facility Location Problem. 574-585 - Amihood Amir, Jessica Ficler, Robert Krauthgamer, Liam Roditty, Oren Sar Shalom:
Multiply Balanced k -Partitioning. 586-597 - Matthias Poloczek, David P. Williamson, Anke van Zuylen:
On Some Recent Approximation Algorithms for MAX SAT. 598-609
Analysis of Algorithms
- Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network. 610-621 - Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Eduardo Pacheco:
Survivability of Swarms of Bouncing Robots. 622-633 - Kévin Perrot, Eric Rémila:
Emergence of Wave Patterns on Kadanoff Sandpiles. 634-647
Computational Algebra
- Deepanjan Kesh, Shashank K. Mehta:
A Divide and Conquer Method to Compute Binomial Ideals. 648-659 - Martin Fürer:
How Fast Can We Multiply Large Integers on an Actual Computer? 660-670
Aplications to Bioinformatics
- Carla Negri Lintzmayer, Zanoni Dias:
Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions. 671-682 - Anna Adamaszek, Alexandru Popa:
Algorithmic and Hardness Results for the Colorful Components Problems. 683-694
Budget Problems
- Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna:
On the Stability of Generalized Second Price Auctions with Budgets. 695-706 - Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Approximation Algorithms for the Max-Buying Problem with Limited Supply. 707-718 - Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan:
Budget Feasible Mechanisms for Experimental Design. 719-730
Algorithms and Data Structures
- Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
LZ77-Based Self-indexing with Faster Pattern Matching. 731-742 - Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura:
Quad-K-d Trees. 743-754 - Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. 755-764
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 2025-12-12 22:52 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:
