Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th ISAAC 2013: Hong Kong, China
- Leizhen Cai, Siu-Wing Cheng
, Tak Wah Lam:
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. Lecture Notes in Computer Science 8283, Springer 2013, ISBN 978-3-642-45029-7
Invited Talk Paper
- Darja Krushevskaja, S. Muthukrishnan:
Market Approach to Social Ads: The MyLikes Example and Related Problems. 1-10
Session 1A: Computational Geometry I
- Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber:
Geodesic-Preserving Polygon Simplification. 11-21 - Jinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama:
Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information. 22-32 - Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. 33-43 - Franz Aurenhammer, Gernot Walzl:
Structure and Computation of Straight Skeletons in 3-Space. 44-54
Session 1B: Pattern Matching
- Amihood Amir, Benny Porat:
Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms. 55-65 - Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and Multiple Consecutive Permutation Motif Search. 66-77 - Pawel Gawrychowski, Damian Straszak:
Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching. 78-88 - Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less Space: Indexing for Queries with Wildcards. 89-99
Session 2A: Computational Complexity I
- Qi Cheng, Jiyou Li, Jincheng Zhuang:
On Determining Deep Holes of Generalized Reed-Solomon Codes. 100-110 - Yota Otachi, Pascal Schweitzer:
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. 111-118 - Youming Qiao, Xiaoming Sun, Nengkun Yu:
Determinantal Complexities and Field Extensions. 119-129
Session 2B: Internet and Social Network Algorithms I
- Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. 130-140 - Marc Lelarge, Hang Zhou:
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs. 141-151 - Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
The Complexity of Finding a Large Subgraph under Anonymity Constraints. 152-162
Session 3A: Graph Theory and Algorithms I
- Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim:
On the Number of Edges of Fan-Crossing Free Graphs. 163-173 - Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl:
Cops and Robbers on Intersection Graphs. 174-184 - Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson:
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. 185-195 - Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy:
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. 196-206
Session 3B: Scheduling Algorithms
- Michael Etscheid:
Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds. 207-217 - Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki:
Better Bounds for Online k-Frame Throughput Maximization in Network Switches. 218-228 - Sam Walker, Yakov Zinder:
The Solvable Cases of a Scheduling Algorithm. 229-239
Session 4A: Computational Complexity II
- Martin Farach-Colton, Meng-Tsung Tsai:
Exact Sublinear Binomial Sampling. 240-250 - Dominik Scheder:
Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. 251-261 - Kevin Buchin, Dirk H. P. Gerrits:
Dynamic Point Labeling is Strongly PSPACE-Complete. 262-272 - Dominik Scheder:
Unsatisfiable CNF Formulas contain Many Conflicts. 273-283
Session 4B: Computational Geometry II
- Kyle Klein, Subhash Suri:
Pursuit Evasion on Polyhedral Surfaces. 284-294 - Wolfgang Mulzer, Yannik Stein:
Algorithms for Tolerated Tverberg Partitions. 295-305 - Cecilia Bohler, Rolf Klein:
Abstract Voronoi Diagrams with Disconnected Regions. 306-316 - Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals:
Terrain Visibility with Multiple Viewpoints. 317-327
Session 5A: Graph Theory and Algorithms II
- Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. 328-338 - Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. 339-349 - Patrizio Angelini, Thomas Bläsius, Ignaz Rutter:
Testing Mutual Duality of Planar Graphs. 350-360
Session 5B: Fixed-Parameter Tractable Algorithms
- Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. 361-371 - René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. 372-382 - Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting Graphs to Minimize the Diameter. 383-393
Session 6A: Algorithms and Data Structures I
- Gonzalo Navarro, Sharma V. Thankachan:
Top-k Document Retrieval in Compact Space and Near-Optimal Time. 394-404 - Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. 405-412 - Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Trajectory-Based Dynamic Map Labeling. 413-423
Session 6B: Internet and Social Network Algorithms II
- Konstantinos Panagiotou, Leo Speidel:
Asynchronous Rumor Spreading on Random Graphs. 424-434 - Yasushi Kawase, Xin Han, Kazuhisa Makino:
Unit Cost Buyback Problem. 435-445 - Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading with Multiple Calls. 446-456
Session 7A: Algorithmic Game Theory
- Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen:
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. 457-467 - Kazuo Murota, Akiyoshi Shioura, Zaifu Yang:
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. 468-478 - Xiangzhong Xiang:
New Results on the Online Pricing Problem. 479-490
Session 7B: Algorithms and Data Structures II
- Lars Arge, Mikkel Thorup:
RAM-Efficient External Memory Sorting. 491-501 - Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct Data Structures for Representing Equivalence Classes. 502-512 - Moni Naor, Eylon Yogev:
Sliding Bloom Filters. 513-523
Session 8A: Graph Theory and Algorithms III
- C. Gregory Plaxton:
Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs. 524-534 - Martin Balko, Pavel Klavík, Yota Otachi:
Bounded Representations of Interval and Proper Interval Graphs. 535-546 - Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Detecting and Counting Small Pattern Graphs. 547-557 - Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. 558-567
Session 8B: Approximation Algorithms I
- Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. 568-578 - Bodo Manthey, Rianne Veenstra:
Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise. 579-589 - Chenglin Fan, Jun Luo, Binhai Zhu:
Tight Approximation Bounds for Connectivity with a Color-Spanning Set. 590-600 - Jing Chen, He Guo, Xin Han, Kazuo Iwama:
The Train Delivery Problem Revisited. 601-611
Session 9A: Computational Geometry III
- Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson:
The Distance 4-Sector of Two Points Is Unique. 612-622 - Takashi Horiyama, Wataru Shoji:
The Number of Different Unfoldings of Polyhedra. 623-633 - Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi:
Computing the Smallest Color-Spanning Axis-Parallel Square. 634-643
Session 9B: Approximation Algorithms II
- Pegah Kamousi, Subhash Suri:
Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. 644-654 - Angsheng Li, Pan Peng:
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. 655-665 - Michael Kerber, R. Sharathkumar:
Approximate Čech Complex in Low and High Dimensions. 666-676
Session 10A: Computational Complexity III
- Friedrich Slivovsky, Stefan Szeider:
Model Counting for Formulas of Bounded Clique-Width. 677-687 - Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
Computing Plurality Points and Condorcet Points in Euclidean Space. 688-698 - Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki:
Computing Minimum Tile Sets to Self-Assemble Color Patterns. 699-710
Session 10B: Network Algorithms
- Xing Shi Cai, Luc Devroye:
A Probabilistic Analysis of Kademlia Networks. 711-721 - Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Approximating the Generalized Minimum Manhattan Network Problem. 722-732 - Haitao Wang:
Minmax Regret 1-Facility Location on Uncertain Path Networks. 733-743
a service of 
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 2024-04-22 20:01 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:
