Search results for "ISAAC"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Sándor P. Fekete, Qian Li 0031, Joseph S. B. Mitchell, Christian Scheffer	Universal Guard Problems.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Martin Böhm 0001, Marek Chrobak, Lukasz Jez, Fei Li 0001, Jirí Sgall, Pavel Veselý 0001	Online Packet Scheduling with Bounded Delay and Lookahead.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Duc A. Hoang 0001, Ryuhei Uehara	Sliding Tokens on a Cactus.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Lucy Ham	A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's Theorem.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Denis Kurz, Petra Mutzel	A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski	Pattern Matching and Consensus Problems on Weighted Sequences and Profiles.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Amirali Abdullah, Samira Daruki, Chitradeep Dutta Roy, Suresh Venkatasubramanian	Streaming Verification of Graph Properties.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber	Packing Short Plane Spanning Trees in Complete Geometric Graphs.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin	Single Machine Scheduling with Job-Dependent Machine Deterioration.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Hirotaka Ono 0001, Yota Otachi	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Sayan Bandyapadhyay, Kasturi R. Varadarajan	Approximate Clustering via Metric Partitioning.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende	Search on a Line by Byzantine Robots.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Qian Li 0012, Xiaoming Sun 0001, Jialin Zhang 0001	On the Optimality of Tape Merge of Two Lists with Similar Size.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001, Hee-Kap Ahn	Assigning Weights to Minimize the Covering Radius in the Plane.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau	Building Clusters with Lower-Bounded Sizes.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Therese Biedl, Saeed Mehrabi 0001	On r-Guarding Thin Orthogonal Polygons.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma	A Refined Definition for Groups of Moving Entities and its Computation.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001, Hee-Kap Ahn	A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Kai Jin	Computing the Pattern Waiting Time: A Revisit of the Intuitive Approach.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Mingyu Xiao 0001, Hiroshi Nagamochi	A Linear-Time Algorithm for Integral Multiterminal Flows in Trees.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Jiangwei Pan, Will Victor	An Efficient Algorithm for Placing Electric Vehicle Charging Stations.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Yasushi Kawase, Kazuhisa Makino	Surrogate Optimization for p-Norms.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Christian Scheffer, Jan Vahrenhold	Approximate Shortest Distances Among Smooth Obstacles in 3D.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Sang Won Bae	L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Udit Agarwal, Vijaya Ramachandran	Finding k Simple Shortest Paths and Cycles.	ISAAC	2016	DBLP DOI BibTeX RDF
1		Front Matter, Table of Contents, Preface, Program Committee, External Reviewers.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Yasushi Kawase, Kazuhisa Makino, Kento Seimi	Optimal Composition Ordering Problems for Piecewise Linear Functions.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità	Fast Approximation Algorithms for the Generalized Survivable Network Design Problem.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Shimin Li, Haitao Wang 0001	Dispersing Points on Intervals.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom	Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton	Bipartite Matching with Linear Edge Weights.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Dmitry Itsykson, Alexander Knop, Dmitry Sokolov 0001	Complexity of Distributions and Average-Case Hardness.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Te-Li Wang, Chih-Kuan Yeh, Ho-Lin Chen	An Improved Tax Scheme for Selfish Routing.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi 0001	Additive Approximation Algorithms for Modularity Maximization.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Akanksha Agrawal 0001, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi	Kernels for Deletion to Classes of Acyclic Digraphs.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Hugo Alves Akitaya, Csaba D. Tóth	Reconstruction of Weakly Simple Polygons from their Edges.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Hung-I Yu, Tien-Ching Lin, Der-Tsai Lee	The (1\|1)-Centroid Problem on the Plane Concerning Distance Constraints.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Amr Elmasry, Frank Kammer	Space-Efficient Plane-Sweep Algorithms.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid	Towards Plane Spanners of Degree 3.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Yasushi Kawase, Atsushi Miyauchi 0001	The Densest Subgraph Problem with a Convex/Concave Size Function.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Hicham El-Zein, J. Ian Munro, Matthew Robertson	Raising Permutations to Powers in Place.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Seok-Hee Hong 0001 (eds.)	27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia	ISAAC	2016	DBLP BibTeX RDF
1	Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam	The Subset Assignment Problem for Data Placement in Caches.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Sebastian Berndt 0001, Maciej Liskiewicz	Hard Communication Channels for Steganography.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella	Scaling and Proximity Properties of Integrally Convex Functions.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Arnab Ganguly 0002, Wing-Kai Hon, Rahul Shah 0001, Sharma V. Thankachan	Space-Time Trade-Offs for the Shortest Unique Substring Problem.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Giordano Da Lozzo	Clustered Planarity with Pipes.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Sándor P. Fekete, Robert T. Schweller, Andrew Winslow	Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov	Min-Power Covering Problems.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Sumedh Tirodkar, Sundar Vishwanathan	On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Michael A. Bender, Samuel McCauley, Andrew McGregor 0001, Shikha Singh 0002, Hoa T. Vu	Run Generation Revisited: What Goes Up May or May Not Come Down.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Matt Gibson 0001, Erik Krohn, Qing Wang 0013	The VC-Dimension of Visibility on the Boundary of a Simple Polygon.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Sebastian Brandt 0002, Nicolas Mattia, Jochen Seidel, Roger Wattenhofer	Toehold DNA Languages are Regular.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Maike Buchin, Stef Sijben	Model-Based Classification of Trajectories.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Andrew Winslow	An Optimal Algorithm for Tiling the Plane with a Translated Polyomino.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot	Competitive Local Routing with Constraints.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Abdolhamid Ghodselahi, Fabian Kuhn	Serving Online Requests with Mobile Servers.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young	Optimal Search Trees with 2-Way Comparisons.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf	Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Lukás Folwarczný, Jirí Sgall	General Caching Is Hard: Even with Small Pages.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Martin Nöllenburg, Roman Prutkin, Ignaz Rutter	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov	Choice Is Hard.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Shahin Kamali, Alejandro López-Ortiz	All-Around Near-Optimal Solutions for the Online Bin Packing Problem.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Chih-Hung Liu 0001, Sandro Montanari	Minimizing the Diameter of a Spanning Tree for Imprecise Points.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Hicham El-Zein, J. Ian Munro, Siwei Yang	On the Succinct Representation of Unlabeled Permutations.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Yasushi Kawase	The Secretary Problem with a Choice Function.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Diptarka Chakraborty, Raghunath Tewari	An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Sergey Bereg, Krzysztof Fleszar 0001, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff 0001	Colored Non-crossing Euclidean Steiner Forest.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Karl Bringmann, Marvin Künnemann	Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Siu-Wing Cheng, Man-Kit Lau	Adaptive Point Location in Planar Convex Subdivisions.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein	An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Dmitry Itsykson, Alexander Knop, Dmitry Sokolov 0001	Heuristic Time Hierarchies via Hierarchies for Sampling Distributions.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Andrew Mastin, Patrick Jaillet, Sang Chin 0001	Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton	The Benefit of Recombination in Noisy Evolutionary Search.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger	Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov	Effectiveness of Structural Restrictions for Hybrid CSPs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Paz Carmi, Lilach Chaitman-Yerushalmi	On the Minimum Cost Range Assignment Problem.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Eli Fox-Epstein, Duc A. Hoang 0001, Yota Otachi, Ryuhei Uehara	Sliding Token on Bipartite Permutation Graphs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Martin Farach-Colton, Meng-Tsung Tsai	On the Complexity of Computing Prime Tables.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Qin Huang, Xingwu Liu, Xiaoming Sun 0001, Jialin Zhang 0001	How to Select the Top k Elements from Evolving Data?	ISAAC	2015	DBLP DOI BibTeX RDF
1	Haitao Wang 0001, Xiao Zhang 0006	Minimizing the Maximum Moving Cost of Interval Coverage.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Maciej Skórski	A New Approximate Min-Max Theorem with Applications in Cryptography.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Petr Hlinený, Gelasio Salazar	On Hardness of the Joint Crossing Number.	ISAAC	2015	DBLP DOI BibTeX RDF
1	David Cattanéo, Simon Perdrix	Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Tomas Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl	Cops and Robbers on String Graphs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Sang Duk Yoon, Min-Gyu Kim 0002, Wanbin Son, Hee-Kap Ahn	Geometric Matching Algorithms for Two Realistic Terrains.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Qian-Ping Gu, Gengchun Xu	Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang 0001	Computing the Gromov-Hausdorff Distance for Metric Trees.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Joshua A. Grochow, Youming Qiao	Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract).	ISAAC	2015	DBLP DOI BibTeX RDF
1	Stefan Funke, Sabine Storandt	Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Matteo Pontecorvi, Vijaya Ramachandran	Fully Dynamic Betweenness Centrality.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Samira Daruki, Justin Thaler, Suresh Venkatasubramanian	Streaming Verification in Data Analysis.	ISAAC	2015	DBLP DOI BibTeX RDF
1	François Le Gall, Shogo Nakajima	Quantum Algorithm for Triangle Finding in Sparse Graphs.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb	When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Khaled M. Elbassioni, Kazuhisa Makino (eds.)	Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings	ISAAC	2015	DBLP DOI BibTeX RDF
1	Moritz von Looz, Henning Meyerhenke, Roman Prutkin	Generating Random Hyperbolic Graphs in Subquadratic Time.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Ashwin Arulselvan, Ágnes Cseh, Martin Groß 0001, David F. Manlove, Jannik Matuschke	Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Sabine Storandt	Approximation Algorithms in the Successive Hitting Set Model.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk	Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.	ISAAC	2015	DBLP DOI BibTeX RDF
1	Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese	Trading off Worst and Expected Cost in Decision Tree Problems.	ISAAC	2015	DBLP DOI BibTeX RDF

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