Accepted Papers
- Yasuko Matsui, Ryuhei Uehara and Takeaki UNO. Enumeration of Perfect Sequences of Chordal Graph
- Eric Goles, Cedric Little and Ivan Rapaport. Understanding a Non-Trivial Cellular Automaton by Finding its Simplest Underlying Communication Protocol
- Weiwei Wu, Minming Li and Enhong Chen. Optimal Key Tree Structure for Deleting Two or More Leaves
- Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler and Jun Luo. Detecting Commuting Patterns by Clustering Subtrajectories
- Andreas Brandstadt, Tilo Klembt, Vadim Lozin and Raffaele Mosca. Independent Sets of Maximum Weight in Apple-Free Graphs
- Beate Bollig and Jochen Klump. New results on the most significant bit of integer multiplication
- Kazuhisa Makino and Hirotaka Ono. Deductive Inference for the Interiors and Exteriors of Horn Theories
- Ryuhei Uehara. Bandwidth of Bipartite Permutation Graphs
- Christian Glasser. Space-Efficient Informational Redundancy
- Harold Gabow and Shuxin Nie. Finding Long Paths, Cycles and Circuits
- Maxim Babenko. An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
- Ali Civril and Malik Magdon-Ismail. Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
- Mingyu Xiao. An improved divide-and-conquer algorithm for fnding all minimum k-way cuts
- Zeyu Guo and He Sun. Greedy Construction of 2-Approximation Minimum Manhattan Network
- Yuta Harada, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita. The Balanced Edge Cover Problem
- Jaroslaw Byrka, Sylvain Guillemot and Jesper Jansson. New Results on Optimizing Rooted Triplets Consistency
- Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na and Chan-Su Shin. Covering a Simple Polygon by Monotone Directions
- Christian Glasser, Christian Reitwießner and Heinz Schmitz. Multiobjective Disk Cover Admits a PTAS
- Prosenjit Bose, Paz Carmi, Sebastien Collette and Michiel Smid. On the Stretch Factor of Convex Delaunay Graphs
- Vadim Lozin. From Tree-width to Clique-width: Excluding a Unit Interval Graph
- Danny Z. Chen and Ewa Misiolek. Free-form Surface Partition in 3-D
- David Buchfuhrer. The complexity of SPP formula minimization
- Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen and Kun-Mao Chao. Minkowski Sum Selection and Finding
- Shuichi Miyazaki and Kazuya Okamoto. Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
- Tobias Friedrich and Nils Hebbinghaus. Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
- Steven Kelk and Leo van Iersel. Constructing the Simplest Possible Phylogenetic Network from Triplets
- Hans L. Bodlaender, Pinar Heggernes and Yngve Villanger. Faster parameterized algorithms for Minimum Fill-In
- Somnath Sikdar, Venkatesh Raman, Saket Saurabh and Sounaka Mishra. Konig Deletion Sets and Vertex Covers Above the Matching Size
- Basile Couetoux, laurent gourves, jerome monnot and Orestis Telelis. On Labeled Traveling Salesman Problems
- M. Oguzhan Kulekci. A method to overcome computer word size limitation in bit-parallel pattern matching
- Ferdinando Cicalese and Martin Milanic. Computing with Priced Information: When the Value Makes the Price
- Christian Knauer and Marc Scherfenberg. Approximate nearest neighbor search under translation invariant Hausdorff distance
- Daniel Delling and Giacomo Nannicini. Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
- Elias Vicari, Matus Mihalak, Peter Widmayer, Alex Hall, Fedor Fomin and Petr Golovach. How to Guard a Graph?
- Hee-Kap Ahn and Sang Won Bae. Covering a Point Set by Two Disjoint Rectangles
- Panagiota Panagopoulou and Paul Spirakis. A Game Theoretic Approach for Efficient Graph Coloring
- Jin-Yi Cai and Pinyan Lu. Signature Theory in Holographic Algorithms
- Martin R. Ehmsen, Lene Favrholdt, Jens S. Kohrt and Rodica Mihai. Comparing First-Fit and Next-Fit for Online Edge Coloring
- Takehiro Ito, Takeaki UNO, Xiao Zhou and Takao Nishizeki. Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
- Loukas Georgiadis. Computing Frequency Dominators and Related Problems
- Takehiro Ito, Erik D. Demaine, Nick Harvey, Christos Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno. On the Complexity of Reconfiguration Problems
- Greg Aloupis, Sebastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristan and Stefanie Wuhrer. Reconfiguration of Cube-Style Modular Robots Using O(log n) Parallel Moves
- Giovanni Di Crescenzo. 3-Round NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
- Hiroki Morizumi and Genki Suzuki. Negation-Limited Inverters of Linear Size
- Eelko Penninkx and Hans L. Bodlaender. A Linear Kernel for the $k$-Disjoint Cycle Problem on Planar Graphs
- Yingchao Zhao, Wei Chen and Shang-Hua Teng. The Isolation Game: A Game of Distances
- Shankar Kalyanaraman and Christopher Umans. The Complexity of Rationalizing Matchings
- Harish Doraiswamy and Vijay Natarajan. Efficient Output-Sensitive Construction of Reeb Graphs
- Daniel Raible and Henning Fernau. Power Domination in $O^*(1.7548^n)$ using Reference Search Trees
- Ludmila Scharf and Marc Scherfenberg. Inducing polygons of line arrangements
- Naveen Garg, Amit Kumar and Muralidhara V N. Minimizing total flow-time : the unrelated case
- Felix König and Marco Lübbecke. Sorting with Complete Networks of Stacks
- Christian Wulff-Nilsen. Computing the Maximum Detour of a Plane Graph in Subquadratic Time
- Joachim Kneis, Alexander Langer and Peter Rossmanith. A New Algorithm for Finding Trees with Many Leaves
- Christian Wulff-Nilsen and Jun Luo. Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
- Gerth Stølting Brodal and Allan Grønlund Jørgensen. Selecting Sums in Arrays
- Michael Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond and Saket Saurabh. Graph Layout problems Parameterized by Vertex Cover
- Marc van Kreveld, Maarten Löffler and Joe Mitchell. Preprocessing Imprecise Points and Splitting Triangulations
- Feodor Dragan and Martin Matamala. Navigating in a graph by aid of its spanning tree
- Karl Bringmann and Tobias Friedrich. Approximating the volume of unions and intersections of high-dimensional geometric objects
- Frank Kammer and Torsten Tholey. The Complexity of Minimum Convex Coloring
- Michael Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan and Jan Arne Telle. Leaf Powers and Their Properties: Using the Trees
- Reid Andersen, Christian borgs, Jennifer Chayes, John Hopcroft, Vahab Mirrokni and Shang-Hua Teng. On the Stability of Web Crawling and Web Search
- Craig Dillabaugh, Meng He and Anil Maheshwari. Succinct and I/O Efficient Data Structures for Traversal in Trees
- Sumit Ganguly. Data stream algorithms via expander graphs
- Paola Flocchini, Bernard Mans and Nicola Santoro. Tree Decontamination with Temporary Immunity
- Leizhen Cai, Elad Verbin and Lin Yang. Firefighting on Trees: (1-1/e)--Approximation, Fixed Parameter Tractability and a New Subexponential Algorithm
- Yoann Dieudonné and Franck Petit. Squaring the Circle with Weak Mobile Robots
- Ashley Montanaro, Harumichi Nishimura and Rudy Raymond. Unbounded-Error Quantum Query Complexity
- Michael Lampis, Georgia Kaouri and Valia Mitsou. On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
- Shantanu Das, Beat Gfeller and Peter Widmayer. Computing Best Swaps in Optimal Tree Spanners
- Evangelos Bampas, Aris Pagourtzis, Giorgos Pierrakos and Katerina Potika. On a Non-Cooperative Model for Wavelength Assignment in Multifiber Optical Networks
- Simon Puglisi and andrew turpin. Space-Time Tradeoffs for Longest-common-prefix Array Computation
- Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, SEIICHIRO TANI and Shigeru Yamashita. Quantum Query Complexity of Boolean Functions with Small On-Sets
- Jonathan Backer and David Kirkpatrick. A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
- Ehsan Chiniforooshan, Arash Farzan and Mehdi Mirzazadeh. Evaluation of General Set Expressions
- Rusins Freivalds. Super-exponential Size Advantage of Quantum Finite Automata with Mixed States
- Binay Bhattacharya, Paz Carmi, Yuzhuang Hu and Qiaosheng Shi. Single Vehicle Scheduling Problem on Networks with Release and Handling Times