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