ISAAC B

79 papers

YearTitle / Authors
2011A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.
Yakov Nekrich
2011A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers - (Extended Abstract).
Jeremy Hurwitz
2011A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria.
Yoshifumi Sakai
2011A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2011A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space.
Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2011Adaptive Phenotype Testing for AND/OR Items.
Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu
2011Algorithm Engineering for Route Planning - An Update -.
Dorothea Wagner
2011Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane.
Ryuta Ando, Tomomi Matsui
2011Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe
2011Algorithms for Building Consensus MUL-trees.
Yun Cui, Jesper Jansson, Wing-Kin Sung
2011An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles.
Danny Z. Chen, Haitao Wang
2011An Index Structure for Spaced Seed Search.
Taku Onodera, Tetsuo Shibuya
2011Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract).
Jörg Lässig, Dirk Sudholt
2011Angle-Restricted Steiner Arborescences for Flow Map Layout.
Kevin Buchin, Bettina Speckmann, Kevin Verbeek
2011Animal Testing.
Adrian Dumitrescu, Evan Hilscher
2011Asymptotic Modularity of Some Graph Classes.
Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
2011Broadcasting in Heterogeneous Tree Networks with Uncertainty.
Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin
2011Capacitated Domination: Constant Factor Approximations for Planar Graphs.
Mong-Jen Kao, D. T. Lee
2011Closest Periodic Vectors in L p Spaces.
Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein
2011Compact Representation of Posets.
Arash Farzan, Johannes Fischer
2011Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem.
Chunhao Wang, Qian-Ping Gu
2011Computing Knapsack Solutions with Cardinality Robustness.
Naonori Kakimura, Kazuhisa Makino, Kento Seimi
2011Computing the Visibility Polygon Using Few Variables.
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
2011Contraction-Based Steiner Tree Approximations in Practice.
Markus Chimani, Matthias Woste
2011Covering and Piercing Disks with Two Centers.
Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
2011Cutting Out Polygons with a Circular Saw.
Adrian Dumitrescu, Masud Hasan
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions.
Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
2011Dominating Induced Matchings for P 7-free Graphs in Linear Time.
Andreas Brandstädt, Raffaele Mosca
2011Dynamic Range Majority Data Structures.
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2011Dynamic Range Selection in Linear Space.
Meng He, J. Ian Munro, Patrick K. Nicholson
2011Edit Distance to Monotonicity in Sliding Windows.
Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang
2011Efficient Algorithms for the Weighted k-Center Problem on a Real Line.
Danny Z. Chen, Haitao Wang
2011Encoding 2D Range Maximum Queries.
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2011Explicit Array-Based Compact Data Structures for Triangulations.
Luca Castelli Aleardi, Olivier Devillers
2011External Memory Orthogonal Range Reporting with Fast Updates.
Yakov Nekrich
2011External-Memory Multimaps.
Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2011Fast Fréchet Queries.
Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
2011Faster Approximate Pattern Matching in Compressed Repetitive Texts.
Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi
2011Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2011Finding Maximum Sum Segments in Sequences with Uncertainty.
Hung-I Yu, Tien-Ching Lin, D. T. Lee
2011Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments.
Sheng-Ying Hsiao
2011Folding Equilateral Plane Graphs.
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz
2011Fully Retroactive Approximate Range and Nearest Neighbor Searching.
Michael T. Goodrich, Joseph A. Simons
2011Generating Realistic Roofs over a Rectilinear Polygon.
Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
2011Hamiltonian Paths in the Square of a Tree.
Jakub Radoszewski, Wojciech Rytter
2011Improved Approximation Algorithms for Routing Shop Scheduling.
Wei Yu, Guochuan Zhang
2011Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph.
M. Reza Khani, Mohammad R. Salavatipour
2011Improved Collaborative Filtering.
Aviv Nisgav, Boaz Patt-Shamir
2011Input-Thrifty Extrema Testing.
Kuan-Chieh Robert Tseng, David G. Kirkpatrick
2011Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations.
Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
2011Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic.
Dmitry Itsykson, Dmitry Sokolov
2011Max-Throughput for (Conservative) k-of-n Testing.
Lisa Hellerstein, Özgür Özkan, Linda Sellie
2011Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions.
Matt Gibson, Dongfeng Han, Milan Sonka, Xiaodong Wu
2011Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius.
Matias Korman
2011On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation.
Ioannis Atsonios, Olivier Beaumont, Nicolas Hanusse, Yusik Kim
2011On the Best Possible Competitive Ratio for Multislope Ski Rental.
Hiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito
2011On the Parameterized Complexity of Consensus Clustering.
Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller
2011Online Linear Optimization over Permutations.
Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda
2011Optimal File Distribution in Peer-to-Peer Networks.
Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
2011Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems.
Tomoyuki Yamakami
2011Outlier Respecting Points Approximation.
Danny Z. Chen, Haitao Wang
2011Packing-Based Approximation Algorithm for the k-Set Cover Problem.
Martin Fürer, Huiwen Yu
2011Parameterized Algorithms for Inclusion of Linear Matchings.
Sylvain Guillemot
2011Parameterized Complexity of the Firefighter Problem.
Cristina Bazgan, Morgan Chopin, Michael R. Fellows
2011Path Queries in Weighted Trees.
Meng He, J. Ian Munro, Gelin Zhou
2011Program Size and Temperature in Self-Assembly.
Ho-Lin Chen, David Doty, Shinnosuke Seki
2011Range LCP.
Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
2011Recognizing Polar Planar Graphs Using New Results for Monopolarity.
Van Bang Le, Ragnar Nevries
2011Robustness of Minimum Cost Arborescences.
Naoyuki Kamiyama
2011Semidefinite Programming and Approximation Algorithms: A Survey.
Sanjeev Arora
2011Simultaneous Embedding of Embedded Planar Graphs.
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
2011Sorting, Searching, and Simulation in the MapReduce Framework.
Michael T. Goodrich, Nodari Sitchinava, Qin Zhang
2011Space-Efficient Data-Analysis Queries on Grids.
Gonzalo Navarro, Luís M. S. Russo
2011Succinct Indexes for Circular Patterns.
Wing-Kai Hon, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan
2011The Parameterized Complexity of Local Search for TSP, More Refined.
Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý
2011The School Bus Problem on Trees.
Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
2011Treemaps with Bounded Aspect Ratio.
Mark de Berg, Bettina Speckmann, Vincent van der Weele
2011Two Fixed-Parameter Algorithms for the Cocoloring Problem.
Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva
2011Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs.
David Avis, Kazuo Iwama, Daichi Paku