Search results for "ISAAC"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi	Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Ronald L. Graham	Bubblesort and Juggling Sequences.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Minkyoung Cho, David M. Mount, Eunhui Park	Maintaining Nets and Net Trees under Incremental Motion.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Ján Manuch, Ladislav Stacho, Christine Stoll	Step-Assembly with a Constant Number of Tile Types.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu	Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He 0001, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala	Untangled Monotonic Chains and Adaptive Range Search.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Robert Franke, Ignaz Rutter, Dorothea Wagner	Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt 0001	Minimum Covering with Travel Cost.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Marek Karpinski, Andrzej Rucinski 0001, Edyta Szymanska	The Complexity of Perfect Matching Problems on Dense Hypergraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Shengyu Zhang 0002	On the Tightness of the Buhrman-Cleve-Wigderson Simulation.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid 0001	A Self-stabilizing and Local Delaunay Graph Construction.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Johannes Schneider 0002, Roger Wattenhofer	Bounds on Contention Management Algorithms.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Hans Raj Tiwary	Complexity of Approximating the Vertex Centroid of a Polyhedron.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz	Online Sorted Range Reporting.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Raphael Eidenbenz, Roger Wattenhofer	Good Programming in Transactional Memory.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jens M. Schmidt	Interval Stabbing Problems in Small Integer Ranges.	ISAAC	2009	DBLP DOI BibTeX RDF	interval stabbing, interval intersection, point enclosure, discrete, static
1	Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos	Exact Algorithms for Dominating Clique Problems.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Scott Schneider 0002, Michael Spertus	A Simple, Fast, and Compact Static Dictionary.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Minming Li	Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Deepanjan Kesh, Shashank K. Mehta	Generalized Reduction to Compute Toric Ideals.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jiong Guo, Rolf Niedermeier, Ondrej Suchý	Parameterized Complexity of Arc-Weighted Directed Steiner Problems.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Csaba D. Tóth	New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Daniël Paulusma, Johan M. M. van Rooij	On Partitioning a Graph into Two Connected Subgraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Ping-Hui Hsu, Kuan-Yu Chen, Kun-Mao Chao	Finding All Approximate Gapped Palindromes.	ISAAC	2009	DBLP DOI BibTeX RDF	palindrome, incremental string comparison, string matching
1	Seok-Hee Hong 0001, Hiroshi Nagamochi	Upward Star-Shaped Polyhedral Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Zhou Xu 0001, Liang Xu	Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.	ISAAC	2009	DBLP DOI BibTeX RDF	min-max vehicle routing, approximation algorithm, inapproximability, path covers
1	Weiwei Wu 0001, Minming Li, Enhong Chen	Min-Energy Scheduling for Aligned Jobs in Accelerate Model.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Rudolf Fleischer, Yihui Wang	On the Camera Placement Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Christian Knauer, Maarten Löffler, Marc Scherfenberg, Thomas Wolle	The Directed Hausdorff Distance between Imprecise Point Sets.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Shiteng Chen, Zhiyi Huang 0002, Sampath Kannan	Reconstructing Numbers from Pairwise Function Values.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Yam Ki Cheung, Ovidiu Daescu	Fréchet Distance Problems in Weighted Regions.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Daniel Bruce, Chính T. Hoàng, Joe Sawada	A Certifying Algorithm for 3-Colorability of P5-Free Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Paul Bell, Igor Potapov	The Identity Correspondence Problem and Its Applications.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Imran A. Pirwani	Shifting Strategy for Geometric Graphs without Geometry.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Takuro Fukunaga	Graph Orientations with Set Connectivity Requirements.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska	Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan 0001	On Lower Bounds for Constant Width Arithmetic Circuits.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Linqing Tang	Conditional Hardness of Approximating Satisfiable Max 3CSP-q.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Decheng Dai, Rong Ge 0001	New Results on Simple Stochastic Games.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann	Editing Graphs into Disjoint Unions of Dense Clusters.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Ping Xu, Xiang-Yang Li 0001	SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara	Algorithmic Folding Complexity.	ISAAC	2009	DBLP DOI BibTeX RDF
1	George Karakostas	General Pseudo-random Generators from Weaker Models of Computation.	ISAAC	2009	DBLP DOI BibTeX RDF	monotone circuit complexity, circuit complexity, Pseudo-random generators
1	Paul S. Bonsma, Felix Breuer	Finding Fullerene Patches in Polynomial Time.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Naoki Katoh, Shin-ichi Tanigawa	On the Infinitesimal Rigidity of Bar-and-Slider Frameworks.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Minghui Jiang 0001	Inapproximability of Maximal Strip Recovery.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Sylvain Guillemot, Jesper Jansson 0001, Wing-Kin Sung	Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Allan Grønlund Jørgensen	Data Structures for Range Median Queries.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Shihong Xu, Hong Shen 0001	The Fault-Tolerant Facility Allocation Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita	Computational Complexity of Cast Puzzles.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama	Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Siddhartha Sen 0001, Robert Endre Tarjan	Deletion without Rebalancing in Multiway Search Trees.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu	Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract).	ISAAC	2009	DBLP DOI BibTeX RDF
1	Hagai Cohen, Ely Porat	Range Non-overlapping Indexing.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé	A Linear Vertex Kernel for Maximum Internal Spanning Tree.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Laurent Bulteau, Guillaume Fertin, Irena Rusu	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms.	ISAAC	2009	DBLP DOI BibTeX RDF	comparative maps, genome comparison, synteny blocks, approximation algorithms, algorithmic complexity
1	Gunnar E. Carlsson, Gurjeet Singh, Afra Zomorodian	Computing Multidimensional Persistence.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Annamária Kovács, Ulrich Meyer 0001, Gabriel Moruz, Andrei Negoescu	Online paging for flash memory devices.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jinhui Xu 0001, Lei Xu 0006, Evanthia Papadopoulou	Computing the Map of Geometric Minimal Cuts.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Anna Huber, Ariel Levavi	Strong Robustness of Randomized Rumor Spreading Protocols.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra (eds.)	Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings	ISAAC	2009	DBLP DOI BibTeX RDF
1	Bodo Manthey, Heiko Röglin	Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Shuai Cheng Li 0001, Yen Kaow Ng	On Protein Structure Alignment under Distance Constraint.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen	Hilbert's Thirteenth Problem and Circuit Complexity.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Yoshitaka Nakao, Hiroshi Nagamochi	Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Darren Strash	Succinct Greedy Geometric Routing in the Euclidean Plane.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave	Counting in the Presence of Memory Faults.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Tamara Mchedlidze, Antonios Symvonis	Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui	An Improved Approximation Algorithm for the Traveling Tournament Problem.	ISAAC	2009	DBLP DOI BibTeX RDF	traveling tournament problem, scheduling, approximation algorithm, lower bound, timetabling
1	Wing-Kai Hon, Tak Wah Lam, Rahul Shah 0001, Siu-Lung Tam, Jeffrey Scott Vitter	Succinct Index for Dynamic Dictionary Matching.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara	Random Generation and Enumeration of Bipartite Permutation Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF	Bipartite permutation graph, Dyck path, Motzkin path, enumeration, counting, random generation
1	Cristina Bazgan, Basile Couëtoux, Zsolt Tuza	Covering a Graph with a Constrained Forest (Extended Abstract).	ISAAC	2009	DBLP DOI BibTeX RDF
1	Sylvain Guillemot, Stéphane Vialette	Pattern Matching for 321-Avoiding Permutations.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Shivali Agarwal, Ankur Narang, R. K. Shyamasundar	Distributed Scheduling of Parallel Hybrid Computations.	ISAAC	2009	DBLP DOI BibTeX RDF	Multithreaded Computation, Scheduling, Algorithm, Work Stealing
1	Tomoyuki Yamakami	The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract).	ISAAC	2009	DBLP DOI BibTeX RDF
1	Xi Chen 0001, Shang-Hua Teng	Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers	Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Martin L. Demaine, Goran Konjevod, Robert J. Lang	Folding a Better Checkerboard.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas	Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001	1-Bounded Space Algorithms for 2-Dimensional Bin Packing.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Amotz Bar-Noy, Michael Lampis	Online Maximum Directed Cut.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Craig Dillabaugh, Meng He 0001, Anil Maheshwari, Norbert Zeh	I/O and Space-Efficient Path Traversal in Planar Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Tai-Hsin Hsu, Hsueh-I Lu	An Optimal Labeling for Node Connectivity.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Sang Won Bae, Yoshio Okamoto	Querying Two Boundary Points for Shortest Paths in a Polygonal Domain.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Lars Arge, Morten Revsbæk	I/O-Efficient Contour Tree Simplification.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Anna Adamaszek, Artur Czumaj, Andrzej Lingas	PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Daniel Andersson, Peter Bro Miltersen	The Complexity of Solving Stochastic Games on Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jonathan A. Kelner, Petar Maymounkov	Electric Routing and Concurrent Flow Cutting.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Li Chen 0002, Bin Fu	Linear and Sublinear Time Algorithms for Basis of Abelian Groups.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Tien-Ching Lin, D. T. Lee	Optimal Randomized Algorithm for the Density Selection Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Toshimasa Ishii, Kazuhisa Makino	Posi-modular Systems with Modulotone Requirements under Permutation Constraints.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Marcin Kaminski 0001, Daniël Paulusma, Dimitrios M. Thilikos	Induced Packing of Odd Cycles in a Planar Graph.	ISAAC	2009	DBLP DOI BibTeX RDF
1	R. Chandrasekaran, K. Subramani 0001	A Combinatorial Algorithm for Horn Programs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Yusuke Kobayashi 0001, Christian Sommer 0001	On Shortest Disjoint Paths in Planar Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa	Exact Algorithms for the Bottleneck Steiner Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Haitao Wang 0001	Locating an Obnoxious Line among Planar Objects.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Jin Wook Kim, Siwon Choi, Joong Chae Na, Jeong Seop Sim	Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model.	ISAAC	2009	DBLP DOI BibTeX RDF	consistent superstring, Aho-Corasick algorithm, string inclusion, string non-inclusion
1	Dae-Young Seo, D. T. Lee, Tien-Ching Lin	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Nikhil Bansal 0001, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko	A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke	On the Advice Complexity of Online Problems.	ISAAC	2009	DBLP DOI BibTeX RDF

Publications at "ISAAC"( http://dblp.L3S.de/Venues/ISAAC )