default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th ISAAC 2017: Phuket, Thailand
- Yoshio Okamoto, Takeshi Tokuyama:
28th International Symposium on Algorithms and Computation, ISAAC 2017, Phuket, Thailand, December 9-12, 2017. LIPIcs 92, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-054-5 - Front Matter, Table of Contents, Preface, External Reviewers. 0:i-0:xvi
- Satoru Iwata:
Weighted Linear Matroid Parity. 1:1-1:5 - Suresh Venkatasubramanian:
Computational Philosophy: On Fairness in Automated Decision Making. 2:1-2:1 - Hee-Kap Ahn
, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. 3:1-3:13 - Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn:
Placing your Coins on a Shelf. 4:1-4:12 - Kazuyuki Amano, Yoshinobu Haruyama:
On the Number of p4-Tilings by an n-Omino. 5:1-5:12 - Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell:
Network Optimization on Partitioned Pairs of Points. 6:1-6:12 - Franz Aurenhammer, Bert Jüttler, Günter Paulini:
Voronoi Diagrams for Parallel Halflines and Line Segments in Space. 7:1-7:10 - Maxim A. Babenko, Stepan Artamonov:
Faster Algorithms for Half-Integral T-Path Packing. 8:1-8:12 - Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. 9:1-9:13 - Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert:
Routing in Polygonal Domains. 10:1-10:13 - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt:
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. 11:1-11:13 - Edvin Berglin, Gerth Stølting Brodal:
A Simple Greedy Algorithm for Dynamic Graph Orientation. 12:1-12:12 - Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded~Pathwidth. 13:1-13:13 - Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti:
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. 14:1-14:13 - Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a Graph into Shortest Paths with Bounded Eccentricity. 15:1-15:13 - Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. 16:1-16:12 - Vincenzo Bonifaci:
On the Convergence Time of a Natural Dynamics for Linear Programming. 17:1-17:12 - Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. 18:1-18:12 - Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang:
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. 19:1-19:13 - Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith:
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. 20:1-20:13 - Lin Chen, Lei Xu, Zhimin Gao, Nolan Shah, Yang Lu, Weidong Shi:
Smart Contract Execution - the (+-)-Biased Ballot Problem. 21:1-21:12 - Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. 22:1-22:13 - Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa:
On Maximal Cliques with Connectivity Constraints in Directed Graphs. 23:1-23:13 - Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson:
Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. 24:1-24:14 - Mark de Berg, Ade Gunawan, Marcel Roeloffzen:
Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces. 25:1-25:13 - Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger:
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. 26:1-26:13 - Mark de Berg, Aleksandar Markovic:
Dynamic Conflict-Free Colorings in the Plane. 27:1-27:13 - Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos:
Temporal Hierarchical Clustering. 28:1-28:12 - Ning Ding:
Agnostically Learning Boolean Functions with Finite Polynomial Representation. 29:1-29:11 - Hicham El-Zein, J. Ian Munro, Yakov Nekrich:
Succinct Color Searching in One Dimension. 30:1-30:11 - Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. 31:1-31:12 - Casper Benjamin Freksen, Kasper Green Larsen:
On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. 32:1-32:12 - Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. 33:1-33:12 - Radoslav Fulek:
Embedding Graphs into Embedded Graphs. 34:1-34:12 - Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Structural Pattern Matching - Succinctly. 35:1-35:13 - Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. 36:1-36:13 - Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. 37:1-37:13 - Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. 38:1-38:12 - Omer Gold, Micha Sharir:
Dominance Product and High-Dimensional Closest Pair under L_infty. 39:1-39:12 - Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Orthogonal Vectors Indexing. 40:1-40:12 - Mordecai J. Golin, Hadi Khodabande, Bo Qin:
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. 41:1-41:13 - Joachim Gudmundsson, Rasmus Pagh:
Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. 42:1-42:13 - Michel Habib, Lalla Mouatadid:
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. 43:1-43:12 - Torben Hagerup, Frank Kammer:
On-the-Fly Array Initialization in Less Space. 44:1-44:12 - Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On Directed Covering and Domination Problems. 45:1-45:12 - Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement Fund Circulation Problem. 46:1-46:13 - Ziyun Huang, Jinhui Xu:
An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions. 47:1-47:13 - Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the Multi-Service Center Problem. 48:1-48:12 - Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Improved Algorithms for Scheduling Unsplittable Flows on Paths. 49:1-49:12 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. 50:1-50:13 - Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita:
Optimal Matroid Partitioning Problems. 51:1-51:13 - Koji M. Kobayashi:
Improved Bounds for Online Dominating Sets of Trees. 52:1-52:13 - Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. 53:1-53:12 - Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek:
Non-Crossing Geometric Steiner Arborescences. 54:1-54:13 - Jessica McClintock, Julián Mestre, Anthony Wirth:
Precedence-Constrained Min Sum Set Cover. 55:1-55:12 - Shuichi Miyazaki, Kazuya Okamoto:
Jointly Stable Matchings. 56:1-56:12 - J. Ian Munro, Gonzalo Navarro, Yakov Nekrich:
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. 57:1-57:12 - Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. 58:1-58:10 - Kengo Nakamura:
Fully Dynamic Connectivity Oracles under General Vertex Updates. 59:1-59:12 - Eunjin Oh, Hee-Kap Ahn:
Finding Pairwise Intersections of Rectangles in a Query Rectangle. 60:1-60:12 - Eunjin Oh, Hee-Kap Ahn:
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms. 61:1-61:12 - Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
Complexity of Coloring Reconfiguration under Recolorability Constraints. 62:1-62:12 - Piotr Sankowski, Piotr Wygocki:
Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. 63:1-63:12 - Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee:
Tight Approximation for Partial Vertex Cover with Hard Capacities. 64:1-64:13 - Rustem Takhanov:
Hybrid VCSPs with Crisp and Valued Conservative Templates. 65:1-65:13 - Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang:
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. 66:1-66:12 - Yu Yokoi:
Envy-free Matchings with Lower Quotas. 67:1-67:12
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-15 22:50 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:
