Search results for "ISAAC"

Hits ?▲	Authors	Title	Venue	Year	Link
1	R. Inkulu, Sanjiv Kapoor	Approximate Euclidean Shortest Paths in Polygonal Domains.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Dominik Scheder, Shuyang Tang, Jiaheng Zhang	Searching for Cryptogenography Upper Bounds via Sum of Square Programming.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Susanne Albers, Leon Ladewig	New Results for the k-Secretary Problem.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz	The Generalized Microscopic Image Reconstruction Problem.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Narthana S. Epa, Junhao Gan, Anthony Wirth	Result-Sensitive Binary Search with Noisy Information.	ISAAC	2019	DBLP DOI BibTeX RDF
1	David Naori, Danny Raz	Online Multidimensional Packing Problems in the Random-Order Model.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Philip Dasler, David M. Mount	Online Algorithms for Warehouse Management.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Christophe Crespelle, Carl Feghali, Petr A. Golovach	Cyclability in Graph Classes.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Yong Chen 0002, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang 0001	A 21/16-Approximation for the Minimum 3-Path Partition Problem.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Paola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita	Gathering and Election by Mobile Robots in a Continuous Cycle.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz	Efficiently Realizing Interval Sequences.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr	On One-Round Discrete Voronoi Games.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Serge Gaspers, Joshua Lau	Minimizing and Computing the Inverse Geodesic Length on Trees.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen	Local Routing in Sparse and Lightweight Geometric Graphs.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Marcin Bienkowski, Lukasz Jez, Pawel Schmidt	Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Hugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk	Distance Measures for Embedded Graphs.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Kyle Fox, Xinyi Li	Approximating the Geometric Edit Distance.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara	On the Complexity of Lattice Puzzles.	ISAAC	2019	DBLP DOI BibTeX RDF
1	David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias 0001	Tracking Paths in Planar Graphs.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Kazuya Haraguchi, Hiroshi Nagamochi	A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Pál András Papp, Roger Wattenhofer	Stabilization Time in Minority Processes.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Koki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa	Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Lorenzo De Stefani	The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Hicham El-Zein, Meng He 0001, J. Ian Munro, Yakov Nekrich, Bryce Sandlund	On Approximate Range Mode and Range Selection.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant	When Maximum Stable Set Can Be Solved in FPT Time.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Gill Barequet, Evanthia Papadopoulou, Martin Suderland	Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Yixin Cao 0001, Zhifeng Wang, Guozhen Rong, Jianxin Wang 0001	Graph Searches and Their End Vertices.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Barbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu 0001, Paolo Penna, Guido Proietti	Dual-Mode Greedy Algorithms Can Save Energy.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra	Triangle Estimation Using Tripartite Independent Set Queries.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Meng He 0001, Serikzhan Kazi	Path and Ancestor Queries over Trees with Multidimensional Weight Vectors.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Binay Bhattacharya, Sandip Das 0001, Subhadeep Ranjan Dev	The Weighted k-Center Problem in Trees for Fixed k.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Wei Chen 0013, Binghui Peng	On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann	Top Tree Compression of Tries.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Kim Thang Nguyen	A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Nader H. Bshouty	Lower Bound for Non-Adaptive Estimation of the Number of Defective Items.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Qilong Feng, Zhen Zhang 0025, Ziyun Huang, Jinhui Xu 0001, Jianxin Wang 0001	Improved Algorithms for Clustering with Outliers.	ISAAC	2019	DBLP DOI BibTeX RDF
1	Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias 0001, Valentin Polishchuk	New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs.	ISAAC	2019	DBLP DOI BibTeX RDF
1	J. Ian Munro, Kaiyu Wu	Succinct Data Structures for Chordal Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Eunpyeong Hong, Mong-Jen Kao	Approximation Algorithm for Vertex Cover with Multiple Covering Constraints.	ISAAC	2018	DBLP DOI BibTeX RDF
1	On-Hei Solomon Lo, Jens M. Schmidt	A Cut Tree Representation for Pendant Pairs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Galia Shabtai, Danny Raz, Yuval Shavitt	A Relaxed FPTAS for Chance-Constrained Knapsack.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Lie Yan	Extensions of Self-Improving Sorters.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal	Half-Duplex Communication Complexity.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Yen-Ting Chen, Meng-Tsung Tsai, Shi-Chun Tsai	A Dichotomy Result for Cyclic-Order Traversing Games.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Travis Gagie, Meng He 0001, Gonzalo Navarro 0001	Tree Path Majority Data Structures.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert	Stabbing Pairwise Intersecting Disks by Five Points.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001	Point Location in Incremental Planar Subdivisions.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Dimitris Fotakis 0001, Laurent Gourvès, Claire Mathieu, Abhinav Srivastav	Covering Clients with Types and Budgets.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Tatsuya Akutsu, Jesper Jansson 0001, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura	New and Improved Algorithms for Unordered Tree Inclusion.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma	Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Hiroshi Hirai 0001, Yuni Iwamasa	Reconstructing Phylogenetic Tree From Multipartite Quartet System.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Quirijn W. Bouts, Thom Castermans, Arthur van Goethem, Marc J. van Kreveld, Wouter Meulemans	Competitive Searching for a Line on a Line Arrangement.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Delia Garijo, Alberto Márquez 0001, Natalia Rodríguez, Rodrigo I. Silveira	Computing Optimal Shortcuts for Networks.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Tomasz Kociumaka, Ritu Kundu, Manal Mohamed 0001, Solon P. Pissis	Longest Unbordered Factor in Quasilinear Time.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Johanna E. Preißer, Jens M. Schmidt	Computing Vertex-Disjoint Paths in Large Graphs Using MAOs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto	Counting Connected Subgraphs with Maximum-Degree-Aware Sieving.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Jian-Jia Chen, Nikhil Bansal 0001, Samarjit Chakraborty, Georg von der Brüggen	Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Andreas Björklund	Exploiting Sparsity for Bipartite Hamiltonicity.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Johannes Blömer, Sascha Brauer, Kathrin Bujna	Coresets for Fuzzy K-Means with Applications.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Tereza Klimosová, Josef Malík, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Veronika Slívová	Colouring (P_r+P_s)-Free Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou 0001	Algorithms for Coloring Reconfiguration Under Recolorability Constraints.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Guillaume Ducoffe, Alexandru Popa 0001	The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Shang-Hua Teng	Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk).	ISAAC	2018	DBLP DOI BibTeX RDF
1	Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit	Deterministic Treasure Hunt in the Plane with Angular Hints.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Takashi Ishizuka, Naoyuki Kamiyama	On the Complexity of Stable Fractional Hypergraph Matching.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Xingwu Liu, Zhida Pan, Yuyi Wang 0001, Roger Wattenhofer	Impatient Online Matching.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Kelin Luo, Thomas Erlebach, Yinfeng Xu	Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Davide Bilò	Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski	Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Parinya Chalermsook, Mayank Goswami 0001, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak	Multi-Finger Binary Search Trees.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Frank Kammer, Andrej Sajenko	Simple 2^f-Color Choice Dictionaries.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare	Approximate Query Processing over Static Sets and Sliding Windows.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Franz Aurenhammer, Michael Steinkogler, Rolf Klein	Partially Walking a Polygon.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Eun Jung Kim 0002, Maria J. Serna, Dimitrios M. Thilikos	Data-Compression for Parametrized Counting Problems on Sparse Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Martin Hoefer 0001, Lisa Wilhelmi	Packing Returning Secretaries.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Maximilian Pfister 0002, Torsten Ueckerdt	Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh	An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.	ISAAC	2018	DBLP DOI BibTeX RDF
1		Front Matter, Table of Contents, Preface, Conference Organization.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Georgia Avarikioti, Yuyi Wang 0001, Roger Wattenhofer	Algorithmic Channel Design.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Nader H. Bshouty, Waseem Makhoul	On Polynomial Time Constructions of Minimum Height Decision Tree.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Clifford Stein 0001	Approximate Matchings in Massive Graphs via Local Structure (Invited Talk).	ISAAC	2018	DBLP DOI BibTeX RDF
1	Ivona Bezáková, Andrew Searns	On Counting Oracles for Path Problems.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Jiehua Chen 0001, Hendrik Molter, Manuel Sorge, Ondrej Suchý	Cluster Editing in Multi-Layer and Temporal Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Wen-Lian Hsu, Der-Tsai Lee, Chung-Shou Liao (eds.)	29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan	ISAAC	2018	DBLP BibTeX RDF
1	Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee 0001	Planar Maximum Matching: Towards a Parallel Algorithm.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh 0001	Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Md Lutfar Rahman, Thomas Watson 0001	Complexity of Unordered CNF Games.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Matthew P. Johnson 0001	Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001	Minimizing Distance-to-Sight in Polygonal Domains.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani	Polyline Drawings with Topological Constraints.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Pavel Dvorák, Dusan Knop, Tomás Toufar	Target Set Selection in Dense Graph Classes.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic 0001, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen	Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Guillaume Ducoffe, Alexandru Popa 0001	The b-Matching Problem in Distance-Hereditary Graphs and Beyond.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell	Diversity Maximization in Doubling Metrics.	ISAAC	2018	DBLP DOI BibTeX RDF
1	David F. Gleich, Nate Veldt, Anthony Wirth	Correlation Clustering Generalized.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao	Approximate Minimum-Weight Matching with Outliers Under Translation.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Divesh Aggarwal, Priyanka Mukhopadhyay	Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki	Proving the Turing Universality of Oritatami Co-Transcriptional Folding.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Alexander Pilz, Patrick Schnider	Extending the Centerpoint Theorem to Multiple Points.	ISAAC	2018	DBLP DOI BibTeX RDF

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