Search results for "ISAAC"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Inferring Strings from Full Abelian Periods.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Jun Yan, Jian Weng 0001, Dongdai Lin, Yujuan Quan	Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract).	ISAAC	2015	DBLP DOI BibTeX RDF
1	Mingyu Xiao 0001	On a Generalization of Nemhauser and Trotter's Local Optimization Theorem.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Timothy M. Chan, Gelin Zhou	Multidimensional Range Selection.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer	Unbounded Discrepancy of Deterministic Random Walks on Grids.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer	Give Me Another One!	ISAAC	2015	DBLP DOI BibTeX RDF
1	Guillaume Fertin, Irena Rusu, Stéphane Vialette	Obtaining a Triangular Matrix by Independent Row-Column Permutations.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001, Jean-Lou De Carufel, Hee-Kap Ahn	The 2-Center Problem in a Simple Polygon.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Wing-Kai Hon, Sharma V. Thankachan, Bojian Xu	An In-place Framework for Exact and Approximate Shortest Unique Substring Queries.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron	Navigating Weighted Regions with Scattered Skinny Tetrahedra.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay	Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Elena Khramtcova, Evanthia Papadopoulou	Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Yi-Jun Chang, Hsu-Chun Yen	Unfolding Orthogonal Polyhedra with Linear Refinement.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Ashwin Arulselvan, Martin Groß 0001, Martin Skutella	Graph Orientation and Flows over Time.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu	Dynamic Interval Scheduling for Multiple Machines.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan	Average-Case Complexity of the Min-Sum Matrix Product Problem.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Haitao Jiang, Haodi Feng, Daming Zhu	An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono 0001	Fixed-Parameter Tractability of Token Jumping on Planar Graphs.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier	Co-Clustering Under the Maximum Norm.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran	Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof	On the Computational Complexity of Vertex Integrity and Component Order Connectivity.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman	The Power and Limitations of Static Binary Search Trees with Lazy Finger.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart	Dynamic and Multi-Functional Labeling Schemes.	ISAAC	2014	DBLP DOI BibTeX RDF
1	J. Ian Munro, Gonzalo Navarro 0001, Jesper Sindahl Nielsen, Rahul Shah 0001, Sharma V. Thankachan	Top- k Term-Proximity in Succinct Space.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Haitao Wang 0001, Jingru Zhang	Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Pawel Gawrychowski, Damian Rusak	Euclidean TSP with Few Inner Points in Linear Space.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Meng He 0001, Ganggui Tang, Norbert Zeh	Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Daniel M. Kane, Osamu Watanabe 0001	A Short Implicant of a CNF Formula with Many Satisfying Assignments.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Piotr Micek, Veit Wiechert	An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono 0001, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara	Depth-First Search Using O(n) Bits.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen	Throughput Maximization in Multiprocessor Speed-Scaling.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu	Lower Bounds for On-line Graph Colorings.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Ei Ando, Shuji Kijima	An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Pat Morin, André van Renssen	The Price of Order.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Therese Biedl, Stefan Huber 0001, Peter Palfrader	Planar Matchings for Weighted Straight Skeletons.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao	The Generalized Popular Condensation Problem.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter	Planar Embeddings with Small and Uniform Faces.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Matthias Henze, Rafel Jaume	Bottleneck Partial-Matching Voronoi Diagrams and Applications.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang 0001, Takehiro Ito, Hirotaka Ono 0001, Yota Otachi, Ryuhei Uehara, Takeshi Yamada	Polynomial-Time Algorithm for Sliding Tokens on Trees.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Alberto Policriti, Nicola Prezza	Hashing and Indexing: Succinct DataStructures and Smoothed Analysis.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Kunihiro Wasa, Hiroki Arimura, Takeaki Uno	Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman 0001	Vertex Cover Reconfiguration and Beyond.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Ruben Becker, Andreas Karrenbauer	A Simple Efficient Interior Point Method for Min-Cost Flow.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Xiaoming Sun 0001, Jia Zhang, Jialin Zhang 0001	Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Hee-Kap Ahn, Chan-Su Shin (eds.)	Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings	ISAAC	2014	DBLP DOI BibTeX RDF
1	Pavel Klavík, Maria Saumell	Minimal Obstructions for Partial Representations of Interval Graphs.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Peter Floderus, Jesper Jansson 0001, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu	3D Rectangulations and Geometric Matrix Multiplication.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Weitian Tong, Guohui Lin	An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Stefan Felsner, Alexander Pilz	Ham-Sandwich Cuts for Abstract Order Types.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar	Rank-Maximal Matchings - Structure and Algorithms.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel	Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Jesper Jansson 0001, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu	Faster Algorithms for Computing the R* Consensus Tree.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Per Kristian Lehre, Carsten Witt	Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Pawan Aurora, Shashank K. Mehta	A Geometric Approach to Graph Isomorphism.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli	Speed-Scaling with No Preemptions.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Zhanpeng Cheng, David Eppstein	Linear-Time Algorithms for Proportional Apportionment.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas	Efficiently Correcting Matrix Products.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak	Faster Existential FO Model Checking on Posets.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Meng He 0001, J. Ian Munro, Gelin Zhou	Dynamic Path Counting and Reporting in Linear Space.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Yuma Inoue, Shin-ichi Minato	An Efficient Method for Indexing All Topological Orders of a Directed Graph.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Pavel Kolev, He Sun 0001	Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Jian Li 0015, Haitao Wang 0001	Range Queries on Uncertain Data.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr 0001	Reconstructing Point Set Order Typesfrom Radial Orderings.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Subhash Suri, Kevin Verbeek	On the Most Likely Voronoi Diagramand Nearest Neighbor Searching.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Cecilia Bohler, Chih-Hung Liu 0001, Evanthia Papadopoulou, Maksym Zavershynskyi	A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau	Approximation Algorithms Inspired by Kernelization Methods.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Hicham El-Zein, J. Ian Munro, Venkatesh Raman 0001	Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto	Minimum-Cost b -Edge Dominating Sets on Trees.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Xingfu Li, Daming Zhu	Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi 0001	Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Norman Huang, Allan Borodin	Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Mingyu Xiao 0001, Hiroshi Nagamochi	Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Nevzat Onur Domaniç, C. Gregory Plaxton	Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Covering Problems for Partial Words and for Indeterminate Strings.	ISAAC	2014	DBLP DOI BibTeX RDF
1	Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen	Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Martin Farach-Colton, Meng-Tsung Tsai	Exact Sublinear Binomial Sampling.	ISAAC	2013	DBLP DOI BibTeX RDF
1	René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond	Myhill-Nerode Methods for Hypergraphs.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Yasushi Kawase, Xin Han, Kazuhisa Makino	Unit Cost Buyback Problem.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi 0001	Computing the Smallest Color-Spanning Axis-Parallel Square.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Pawel Gawrychowski, Damian Straszak	Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Amihood Amir, Benny Porat	Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms.	ISAAC	2013	DBLP DOI BibTeX RDF
1	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.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette	Single and Multiple Consecutive Permutation Motif Search.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Kyle Klein, Subhash Suri	Pursuit Evasion on Polyhedral Surfaces.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Moshe Lewenstein, J. Ian Munro, Venkatesh Raman 0001, Sharma V. Thankachan	Less Space: Indexing for Queries with Wildcards.	ISAAC	2013	DBLP DOI BibTeX RDF
1	C. Gregory Plaxton	Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Jinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama	Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Pegah Kamousi, Subhash Suri	Euclidean Traveling Salesman Tours through Stochastic Neighborhoods.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Cecilia Bohler, Rolf Klein	Abstract Voronoi Diagrams with Disconnected Regions.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg	Trajectory-Based Dynamic Map Labeling.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson	SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell	Detecting and Counting Small Pattern Graphs.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Takashi Horiyama, Wataru Shoji	The Number of Different Unfoldings of Polyhedra.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao	Computing Plurality Points and Condorcet Points in Euclidean Space.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Michael Kerber, R. Sharathkumar	Approximate Čech Complex in Low and High Dimensions.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald	Faster Rumor Spreading with Multiple Calls.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim	On the Number of Edges of Fan-Crossing Free Graphs.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Bodo Manthey, Rianne Veenstra	Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Mingyu Xiao 0001, Hiroshi Nagamochi	Exact Algorithms for Maximum Independent Set.	ISAAC	2013	DBLP DOI BibTeX RDF
1	Chenglin Fan, Jun Luo 0008, Binhai Zhu	Tight Approximation Bounds for Connectivity with a Color-Spanning Set.	ISAAC	2013	DBLP DOI BibTeX RDF

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