Search results for "ISAAC"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Ahad N. Zehmakan	Opinion Forming in Erdös-Rényi Random Graph and Expanders.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno	Efficient Enumeration of Dominating Sets for Sparse Graphs.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Qilong Feng, Guanlan Tan, Senmin Zhu, Bin Fu, Jianxin Wang 0001	New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Andreas Björklund, Thore Husfeldt	Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Seungbum Jo, Srinivasa Rao Satti	Encoding Two-Dimensional Range Top-k Queries Revisited.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Vahideh Keikha, Mees van de Kerkhof, Marc J. van Kreveld, Irina Kostitsyna, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen, Lionov Wiratma	Convex Partial Transversals of Planar Regions.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Martin Farach-Colton, Meng Li, Meng-Tsung Tsai	Streaming Algorithms for Planar Convex Hulls.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Davide Bilò, Kleitos Papadopoulos	A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Adam Kunysz	An Algorithm for the Maximum Weight Strongly Stable Matching Problem.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Michael Matheny, Jeff M. Phillips	Computing Approximate Statistical Discrepancy.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar 0001, Joachim Spoerhase, Alexander Wolff 0001	Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Giordano Da Lozzo, Ignaz Rutter	Approximation Algorithms for Facial Cycles in Planar Embeddings.	ISAAC	2018	DBLP DOI BibTeX RDF
1	Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele	Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Mordecai J. Golin, Hadi Khodabande, Bo Qin	Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek	Non-Crossing Geometric Steiner Arborescences.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa	On Maximal Cliques with Connectivity Constraints in Directed Graphs.	ISAAC	2017	DBLP DOI BibTeX RDF
1		Front Matter, Table of Contents, Preface, External Reviewers.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan	On Structural Parameterizations of the Edge Disjoint Paths Problem.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Kazuyuki Amano, Yoshinobu Haruyama	On the Number of p4-Tilings by an n-Omino.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn	Placing your Coins on a Shelf.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Arnab Ganguly 0002, Rahul Shah 0001, Sharma V. Thankachan	Structural Pattern Matching - Succinctly.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Mark de Berg, Aleksandar Markovic 0001	Dynamic Conflict-Free Colorings in the Plane.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001, Hee-Kap Ahn	Finding Pairwise Intersections of Rectangles in a Query Rectangle.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot	Decomposing a Graph into Shortest Paths with Bounded Eccentricity.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Athanasios L. Konstantinidis, Charis Papadopoulos	Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno	Settlement Fund Circulation Problem.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Ning Ding 0001	Agnostically Learning Boolean Functions with Finite Polynomial Representation.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Suresh Venkatasubramanian	Computational Philosophy: On Fairness in Automated Decision Making.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Michel Habib, Lalla Mouatadid	Maximum Induced Matching Algorithms via Vertex Ordering Characterizations.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Mark de Berg, Ade Gunawan, Marcel Roeloffzen	Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Torben Hagerup, Frank Kammer	On-the-Fly Array Initialization in Less Space.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Piotr Sankowski, Piotr Wygocki	Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh 0001, Ji-won Park, André van Renssen, Antoine Vigneron	Faster Algorithms for Growing Prioritized Disks and Rectangles.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Eunjin Oh 0001, Hee-Kap Ahn	A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Yu Yokoi	Envy-free Matchings with Lower Quotas.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Yoshio Okamoto, Takeshi Tokuyama (eds.)	28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand	ISAAC	2017	DBLP BibTeX RDF
1	Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel	Crossing Number for Graphs with Bounded~Pathwidth.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith	An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Koji M. Kobayashi	Improved Bounds for Online Dominating Sets of Trees.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Omer Gold, Micha Sharir	Dominance Product and High-Dimensional Closest Pair under L_infty.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Joachim Gudmundsson, Rasmus Pagh	Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Hicham El-Zein, J. Ian Munro, Yakov Nekrich	Succinct Color Searching in One Dimension.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot	Routing on the Visibility Graph.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Mark de Berg, Tim Leijsen, Aleksandar Markovic 0001, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Lin Chen 0009, Lei Xu 0012, Zhimin Gao, Nolan Shah, Yang Lu 0010, Weidong Shi	Smart Contract Execution - the (+-)-Biased Ballot Problem.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono 0001	On Directed Covering and Domination Problems.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Casper Benjamin Freksen, Kasper Green Larsen	On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Jessica McClintock, Julián Mestre, Anthony Wirth	Precedence-Constrained Min Sum Set Cover.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos	Shortcuts for the Circle.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Barbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu 0001, Paolo Penna	Sorting with Recurrent Comparison Errors.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee	Tight Approximation for Partial Vertex Cover with Hard Capacities.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes	Study of a Combinatorial Game in Graphs Through Linear Programming.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos	Temporal Hierarchical Clustering.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman	Improved Algorithms for Scheduling Unsplittable Flows on Paths.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Rustem Takhanov	Hybrid VCSPs with Crisp and Valued Conservative Templates.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Vincenzo Bonifaci	On the Convergence Time of a Natural Dynamics for Linear Programming.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Maxim A. Babenko, Stepan Artamonov	Faster Algorithms for Half-Integral T-Path Packing.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Edvin Berglin, Gerth Stølting Brodal	A Simple Greedy Algorithm for Dynamic Graph Orientation.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Ziyun Huang, Jinhui Xu 0001	An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi 0001	Complexity of the Multi-Service Center Problem.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Shuichi Miyazaki, Kazuya Okamoto	Jointly Stable Matchings.	ISAAC	2017	DBLP DOI BibTeX RDF
1	J. Ian Munro, Gonzalo Navarro 0001, Yakov Nekrich	Fast Compressed Self-Indexes with Deterministic Linear-Time Construction.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt 0001	Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Isaac Goldstein, Moshe Lewenstein, Ely Porat	Orthogonal Vectors Indexing.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson	Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama	Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Kengo Nakamura 0001	Fully Dynamic Connectivity Oracles under General Vertex Updates.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert	Routing in Polygonal Domains.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos	Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma	Independent Feedback Vertex Set for P_5-free Graphs.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Satoru Iwata 0001	Weighted Linear Matroid Parity.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell	Network Optimization on Partitioned Pairs of Points.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Radoslav Fulek	Embedding Graphs into Embedded Graphs.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Yao Xu, Yong Chen 0002, Guohui Lin, Tian Liu 0001, Taibo Luo, Peng Zhang 0008	A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou 0001	Complexity of Coloring Reconfiguration under Recolorability Constraints.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang 0018	An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita	Optimal Matroid Partitioning Problems.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Franz Aurenhammer, Bert Jüttler, Günter Paulini	Voronoi Diagrams for Parallel Halflines and Line Segments in Space.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Sándor P. Fekete, Phillip Keldenich	Conflict-Free Coloring of Intersection Graphs.	ISAAC	2017	DBLP DOI BibTeX RDF
1	Akanksha Agrawal 0001, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi	Simultaneous Feedback Edge Set: A Parameterized Perspective.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Timothy M. Chan, Dimitrios Skrepetos	All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Xuemin Lin 0001	Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk).	ISAAC	2016	DBLP DOI BibTeX RDF
1	Pavel Klavík, Yota Otachi, Jirí Sejnoha	On the Classes of Interval Graphs of Limited Nesting and Count of Lengths.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Yutaro Yamaguchi 0001	Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Kunsoo Park	Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk).	ISAAC	2016	DBLP DOI BibTeX RDF
1	Hoàng-Oanh Le, Van Bang Le	On the Complexity of Matching Cut in Graphs of Fixed Diameter.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Michael Etscheid, Matthias Mnich	Linear Kernels and Linear-Time Algorithms for Finding Large Cuts.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Di Chen, Mordecai J. Golin	Sink Evacuation on Trees with Dynamic Confluent Flows.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Lijie Chen 0001	Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Spyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis	Hierarchical Time-Dependent Oracles.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong	Optimal Nonpreemptive Scheduling in a Smart Grid Model.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Mong-Jen Kao, Hai-Lun Tu, D. T. Lee	O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Christopher S. Martin, Mohammad R. Salavatipour	Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind	Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Helmut Alt, Nadja Scharf	Approximating Smallest Containers for Packing Three-Dimensional Convex Objects.	ISAAC	2016	DBLP DOI BibTeX RDF
1	T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu 0001	On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Yangwei Liu, Hu Ding, Ziyun Huang, Jinhui Xu 0001	Distributed and Robust Support Vector Machine.	ISAAC	2016	DBLP DOI BibTeX RDF
1	Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti	Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.	ISAAC	2016	DBLP DOI BibTeX RDF

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