Search results for "ISAAC"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Andrej Brodnik, Marko Grgurovic	Speeding Up Shortest Path Algorithms.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song 0002	Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights.	ISAAC	2012	DBLP DOI BibTeX RDF
1	René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller	Interval Scheduling and Colorful Independent Sets.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Ching-Chen Kuo, Hsueh-I Lu	Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Tsvi Kopelowitz, Nimrod Talmon	Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting.	ISAAC	2012	DBLP DOI BibTeX RDF
1	John E. Hopcroft	Future Directions in Computer Science Research.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee (eds.)	Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings	ISAAC	2012	DBLP DOI BibTeX RDF
1	Yunlong Liu, Xiaodong Wu	Solving Circular Integral Block Decomposition in Polynomial Time.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Sang Won Bae, Yoshio Okamoto, Chan-Su Shin	Area Bounds of Rectilinear Polygons Realized by Angle Sequences.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky	Strong Conflict-Free Coloring for Intervals.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Yoshifumi Sakai	Computing the Longest Common Subsequence of Two Run-Length Encoded Strings.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Dieter Kratsch, Daniël Paulusma	Detecting Induced Minors in AT-Free Graphs.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Jiong Guo, Yash Raj Shrestha	Kernelization and Parameterized Complexity of Star Editing and Union Editing.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata	Segmental Mapping and Distance for Rooted Labeled Ordered Trees.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine	On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets.	ISAAC	2012	DBLP DOI BibTeX RDF
1	Hee-Kap Ahn, Sang-Sub Kim 0001, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron	Covering and Piercing Disks with Two Centers.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Matias Korman	Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Ryuta Ando, Tomomi Matsui	Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane.	ISAAC	2011	DBLP DOI BibTeX RDF
1	M. Reza Khani, Mohammad R. Salavatipour	Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Hung-I Yu, Tien-Ching Lin, D. T. Lee	Finding Maximum Sum Segments in Sequences with Uncertainty.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe 0001 (eds.)	Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings	ISAAC	2011	DBLP DOI BibTeX RDF
1	Yakov Nekrich	A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller	On the Parameterized Complexity of Consensus Clustering.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Hiroshi Fujiwara, Takuma Kitano, Toshihiro Fujito	On the Best Possible Competitive Ratio for Multislope Ski Rental.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Haitao Wang 0001	Outlier Respecting Points Approximation.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler	External-Memory Multimaps.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Chunhao Wang, Qian-Ping Gu	Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Haitao Wang 0001	Efficient Algorithms for the Weighted k-Center Problem on a Real Line.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Jakub Radoszewski, Wojciech Rytter	Hamiltonian Paths in the Square of a Tree.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Joseph A. Simons	Fully Retroactive Approximate Range and Nearest Neighbor Searching.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Raffaele Mosca	Dominating Induced Matchings for P 7-free Graphs in Linear Time.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Aviv Nisgav, Boaz Patt-Shamir	Improved Collaborative Filtering.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz	Folding Equilateral Plane Graphs.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Haitao Wang 0001	An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Lisa Hellerstein, Özgür Özkan, Linda Sellie	Max-Throughput for (Conservative) k-of-n Testing.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Wing-Kai Hon, Chen-Hua Lu, Rahul Shah 0001, Sharma V. Thankachan	Succinct Indexes for Circular Patterns.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda	Online Linear Optimization over Permutations.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski 0001, Daniël Paulusma	Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Sanjeev Arora	Semidefinite Programming and Approximation Algorithms: A Survey.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio, Ana Silva 0001	Two Fixed-Parameter Algorithms for the Cocoloring Problem.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Travis Gagie, Pawel Gawrychowski, Simon J. Puglisi	Faster Approximate Pattern Matching in Compressed Repetitive Texts.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Wei Yu 0010, Guochuan Zhang	Improved Approximation Algorithms for Routing Shop Scheduling.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat	Range LCP.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Luca Castelli Aleardi, Olivier Devillers	Explicit Array-Based Compact Data Structures for Triangulations.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Dorothea Wagner	Algorithm Engineering for Route Planning - An Update -.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Ho-Lin Chen, David Doty, Shinnosuke Seki	Program Size and Temperature in Self-Assembly.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Yakov Nekrich	External Memory Orthogonal Range Reporting with Fast Updates.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Tobias Friedrich 0001, Thomas Sauerwald, Alexandre Stauffer	Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Tomoyuki Yamakami	Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Martin Fürer, Huiwen Yu	Packing-Based Approximation Algorithm for the k-Set Cover Problem.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao 0001	Encoding 2D Range Maximum Queries.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Fabien de Montgolfier, Mauricio Soto, Laurent Viennot	Asymptotic Modularity of Some Graph Classes.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Naonori Kakimura, Kazuhisa Makino, Kento Seimi	Computing Knapsack Solutions with Cardinality Robustness.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Ioannis Atsonios, Olivier Beaumont, Nicolas Hanusse, Yusik Kim	On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Mong-Jen Kao, D. T. Lee	Capacitated Domination: Constant Factor Approximations for Planar Graphs.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Yoshifumi Sakai	A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Mark de Berg, Bettina Speckmann, Vincent van der Weele	Treemaps with Bounded Aspect Ratio.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Masud Hasan	Cutting Out Polygons with a Circular Saw.	ISAAC	2011	DBLP DOI BibTeX RDF
1	David Avis, Kazuo Iwama, Daichi Paku	Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati	Simultaneous Embedding of Embedded Planar Graphs.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Pranabendu Misra, Venkatesh Raman 0001, M. S. Ramanujan 0001, Saket Saurabh 0001	A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Jeremy Hurwitz	A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers - (Extended Abstract).	ISAAC	2011	DBLP DOI BibTeX RDF
1	Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron	Generating Realistic Roofs over a Rectilinear Polygon.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira	Computing the Visibility Polygon Using Few Variables.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller	Optimal File Distribution in Peer-to-Peer Networks.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Van Bang Le, Ragnar Nevries	Recognizing Polar Planar Graphs Using New Results for Monopolarity.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Dmitry Itsykson, Dmitry Sokolov 0001	Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Amr Elmasry, Meng He 0001, J. Ian Munro, Patrick K. Nicholson	Dynamic Range Majority Data Structures.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità	The School Bus Problem on Trees.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita	A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Kevin Buchin, Bettina Speckmann, Kevin Verbeek	Angle-Restricted Steiner Arborescences for Flow Map Layout.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Sheng-Ying Hsiao	Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Meng He 0001, J. Ian Munro, Gelin Zhou	Path Queries in Weighted Trees.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Arash Farzan, Johannes Fischer 0001	Compact Representation of Posets.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Matt Gibson 0001, Dongfeng Han, Milan Sonka, Xiaodong Wu 0001	Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Luís M. S. Russo	Space-Efficient Data-Analysis Queries on Grids.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin	Broadcasting in Heterogeneous Tree Networks with Uncertainty.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý	The Parameterized Complexity of Local Search for TSP, More Refined.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann 0001, Stephen G. Kobourov	Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Meng He 0001, J. Ian Munro, Patrick K. Nicholson	Dynamic Range Selection in Linear Space.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Evan Hilscher	Animal Testing.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson	Fast Fréchet Queries.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Cristina Bazgan, Morgan Chopin, Michael R. Fellows	Parameterized Complexity of the Firefighter Problem.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Sylvain Guillemot	Parameterized Algorithms for Inclusion of Linear Matchings.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Naoyuki Kamiyama	Robustness of Minimum Cost Arborescences.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Yun Cui, Jesper Jansson 0001, Wing-Kin Sung	Algorithms for Building Consensus MUL-trees.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Jörg Lässig, Dirk Sudholt	Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract).	ISAAC	2011	DBLP DOI BibTeX RDF
1	Kuan-Chieh Robert Tseng, David G. Kirkpatrick	Input-Thrifty Extrema Testing.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang 0001	Edit Distance to Monotonicity in Sliding Windows.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein	Closest Periodic Vectors in L p Spaces.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Markus Chimani, Matthias Woste	Contraction-Based Steiner Tree Approximations in Practice.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Taku Onodera, Tetsuo Shibuya	An Index Structure for Spaced Seed Search.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu	Adaptive Phenotype Testing for AND/OR Items.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Nodari Sitchinava, Qin Zhang 0001	Sorting, Searching, and Simulation in the MapReduce Framework.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister 0001, Saket Saurabh 0001	Bandwidth on AT-Free Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Naoki Katoh	A Proof of the Molecular Conjecture.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Xiao Zhou 0001, Takao Nishizeki	Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Haitao Wang 0001	Approximating Points by a Piecewise Linear Function: I.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Telikepalli Kavitha, Meghana Nasre	Popular Matchings with Variable Job Capacities.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Donald Stanley, Boting Yang	Lower Bounds on Fast Searching.	ISAAC	2009	DBLP DOI BibTeX RDF

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