default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th ISAAC 2014: Jeonju, Korea
- Hee-Kap Ahn, Chan-Su Shin:
Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Lecture Notes in Computer Science 8889, Springer 2014, ISBN 978-3-319-13074-3
Computational Geometry
- Haitao Wang, Jingru Zhang:
Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane. 3-14 - Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman
, Pavel Valtr:
Reconstructing Point Set Order Typesfrom Radial Orderings. 15-26 - Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. 27-37
Combinatorial Optimization
- Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan:
Average-Case Complexity of the Min-Sum Matrix Product Problem. 41-52 - Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas:
Efficiently Correcting Matrix Products. 53-64 - Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. 65-78
Graph Algorithms: Enumeration
- Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel:
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. 81-93 - Kunihiro Wasa, Hiroki Arimura, Takeaki Uno:
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. 94-102 - Yuma Inoue, Shin-ichi Minato:
An Efficient Method for Indexing All Topological Orders of a Directed Graph. 103-114
Matching and Assignment
- Therese Biedl, Stefan Huber, Peter Palfrader:
Planar Matchings for Weighted Straight Skeletons. 117-127 - Meng He, Ganggui Tang, Norbert Zeh:
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. 128-140 - Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
Dynamic and Multi-Functional Labeling Schemes. 141-153
Data Structures and Algorithms
- Alberto Policriti, Nicola Prezza:
Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. 157-168 - J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan:
Top- k Term-Proximity in Succinct Space. 169-180 - Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. 181-192
Fixed-Parameter Tractable Algorithms
- Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b -Edge Dominating Sets on Trees. 195-207 - Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. 208-219 - Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. 220-232
Scheduling Algorithms
- Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Interval Scheduling for Multiple Machines. 235-246 - Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen:
Throughput Maximization in Multiprocessor Speed-Scaling. 247-258 - Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Speed-Scaling with No Preemptions. 259-269
Computational Complexity
- Daniel M. Kane, Osamu Watanabe:
A Short Implicant of a CNF Formula with Many Satisfying Assignments. 273-284 - Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof:
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. 285-297 - Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. 298-309
Computational Geometry
- Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. 313-325 - Jian Li, Haitao Wang:
Range Queries on Uncertain Data. 326-337 - Subhash Suri, Kevin Verbeek:
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching. 338-350
Approximation Algorithms
- Weitian Tong, Guohui Lin:
An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem. 353-364 - Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi:
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography. 365-375 - Ei Ando, Shuji Kijima:
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. 376-386
Graph Theory and Algorithms
- Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. 389-400 - Pavel Klavík, Maria Saumell:
Minimal Obstructions for Partial Representations of Interval Graphs. 401-413 - Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu:
Faster Algorithms for Computing the R* Consensus Tree. 414-425
Fixed-Parameter Tractable Algorithms
- Mingyu Xiao, Hiroshi Nagamochi:
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. 429-440 - Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. 441-451 - Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. 452-463
Graph Algorithms: Approximation
- Xingfu Li, Daming Zhu:
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover. 467-478 - Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Approximation Algorithms Inspired by Kernelization Methods. 479-490 - Haitao Jiang, Haodi Feng, Daming Zhu:
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. 491-503
Online and Approximation Algorithms
- Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower Bounds for On-line Graph Colorings. 507-515 - Piotr Micek, Veit Wiechert:
An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. 516-527 - Norman Huang, Allan Borodin:
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization. 528-539
Data Structures and Algorithms
- Hicham El-Zein, J. Ian Munro, Venkatesh Raman:
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. 543-552 - Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara:
Depth-First Search Using O(n) Bits. 553-564 - Meng He, J. Ian Munro, Gelin Zhou:
Dynamic Path Counting and Reporting in Linear Space. 565-577
Matching and Assignment
- Zhanpeng Cheng, David Eppstein:
Linear-Time Algorithms for Proportional Apportionment. 581-592 - Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar:
Rank-Maximal Matchings - Structure and Algorithms. 593-605 - Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
The Generalized Popular Condensation Problem. 606-617
Graph Algorithms: Approximation
- Pavel Kolev, He Sun:
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. 621-632 - Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter:
Planar Embeddings with Small and Uniform Faces. 633-645 - Nevzat Onur Domaniç, C. Gregory Plaxton:
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties. 646-657
Combinatorial Optimization
- Xiaoming Sun, Jia Zhang, Jialin Zhang:
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol. 661-673 - Pawan Aurora, Shashank K. Mehta:
A Geometric Approach to Graph Isomorphism. 674-685 - Per Kristian Lehre, Carsten Witt:
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. 686-697
Computational Geometry
- Pawel Gawrychowski, Damian Rusak:
Euclidean TSP with Few Inner Points in Linear Space. 701-713 - Matthias Henze, Rafel Jaume:
Bottleneck Partial-Matching Voronoi Diagrams and Applications. 714-725 - Stefan Felsner, Alexander Pilz:
Ham-Sandwich Cuts for Abstract Order Types. 726-737
Network and Scheduling Algorithms
- Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows over Time. 741-752 - Ruben Becker, Andreas Karrenbauer:
A Simple Efficient Interior Point Method for Min-Cost Flow. 753-765 - Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. 766-778
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-10-22 02:22 CEST 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:
