| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 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 | Tanja Hartmann, Jonathan Rollin, Ignaz Rutter |
Cubic Augmentation of Planar Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, J. Ian Munro, Gelin Zhou |
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto |
Universal Point Subsets for Planar Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine |
Origami Robots and Star Trek Replicators. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | François Le Gall |
A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner |
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | John E. Hopcroft |
Future Directions in Computer Science Research. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis |
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evanthia Papadopoulou, Maksym Zavershynskyi |
On Higher Order Voronoi Diagrams of Line Segments. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei Yu, Mordecai J. Golin, Guochuan Zhang |
Vehicle Scheduling on a Graph Revisited. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Meng He, Patrick K. Nicholson, Norbert Zeh |
A Space-Efficient Framework for Dynamic Point Location. |
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 | Tomoyuki Yamakami |
Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Haitao Wang |
Weak Visibility Queries of Line Segments in Simple Polygons. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc J. van Kreveld, Maarten Löffler, János Pach |
How Many Potatoes Are in a Mesh? |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Romeo Rizzi, Stéphane Vialette |
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen |
Finger Search in the Implicit Model. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Linear Layouts in Submodular Systems. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arya Mazumdar |
On Almost Disjunct Matrices for Group Testing. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi |
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Disser, Jannik Matuschke |
Degree-Constrained Orientations of Embedded Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Takeyuki Tamura |
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney |
On the Hyperbolicity of Small-World and Tree-Like Random Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanja Hartmann, Dorothea Wagner |
Fast and Simple Fully-Dynamic Cut Tree Construction. |
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 | Akitoshi Kawamura, Yusuke Kobayashi |
Fence Patrolling by Mobile Agents with Distinct Speeds. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh |
The Minimum Vulnerability Problem. |
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 | Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa |
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). |
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 | Andrej Brodnik, Marko Grgurovic |
Speeding Up Shortest Path Algorithms. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Riku Saikkonen, Eljas Soisalon-Soininen |
A General Method for Improving Insertion-Based Adaptive Sorting. |
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 | Nanao Kita |
A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son |
Computing k-center over Streaming Data for Small k. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song |
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prudence W. H. Wong, Fencol C. C. Yung, Mihai Burcea |
An 8/3 Lower Bound for Online Dynamic Bin Packing. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe |
Interval Graph Representation with Given Interval and Intersection Lengths. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Arne Leitert, Dieter Rautenbach |
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Anton Krohmer |
Parameterized Clique on Scale-Free Networks. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chinmoy Dutta, Jaikumar Radhakrishnan |
More on a Problem of Zarankiewicz. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh |
Extending Partial Representations of Subclasses of Chordal Graphs. |
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 | Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala |
Robust Nonparametric Data Approximation of Point Sets via Data Reduction. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Reza Dorrigiv, Meng He, Norbert Zeh |
On the Advice Complexity of Buffer Management. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli |
Green Scheduling, Flows and Matchings. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Combinatorial Geometry and Approximation Algorithms. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Frati, Joachim Gudmundsson, Emo Welzl |
On the Number of Upward Planar Orientations of Maximal Planar Graphs. |
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 | 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 | Christos Makris, Konstantinos Tsakalidis |
An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yamming Huang, Chung-Shou Liao |
The Canadian Traveller Problem Revisited. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | H. F. Ting, Xiangzhong Xiang |
Multi-unit Auctions with Budgets and Non-uniform Valuations. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Pim van 't Hof, Marcin Kaminski |
Induced Immersions. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
Efficient Counting of Square Substrings in a Tree. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang |
Revenue Maximization in a Bayesian Double Auction Market. |
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 | Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski |
Beyond Homothetic Polygons: Recognition and Maximum Clique. |
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 | Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu |
Optimal Point Movement for Covering Circular Regions. |
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 | Takeaki Uno |
Efficient Computation of Power Indices for Weighted Majority Games. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Norie Fu |
A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi |
Counting Partitions of Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung-I Yu, Cheng-Chung Li |
The Multi-Service Center Problem. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evanthia Papadopoulou, Sandeep K. Dey |
On the Farthest Line-Segment Voronoi Diagram. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou |
Reconfiguration of List L(2, 1)-Labelings in a Graph. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumit Ganguly |
Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna E. Paluch |
Popular and Clan-Popular b-Matchings. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Evan Hilscher |
Animal Testing. |
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 | Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson |
Dynamic Range Majority Data Structures. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Itsykson, Dmitry Sokolov |
Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic. |
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 | Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller |
On the Parameterized Complexity of Consensus Clustering. |
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 | 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 | Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat |
Range LCP. |
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 | Jeremy Hurwitz |
A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers - (Extended Abstract). |
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 | Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. |
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 | Markus Chimani, Matthias Woste |
Contraction-Based Steiner Tree Approximations in Practice. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Z. Chen, Haitao Wang |
Efficient Algorithms for the Weighted k-Center Problem on a Real Line. |
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 | Andreas Brandstädt, Raffaele Mosca |
Dominating Induced Matchings for P 7-free Graphs in Linear Time. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot |
Parameterized Algorithms for Inclusion of Linear Matchings. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt Gibson, Dongfeng Han, Milan Sonka, Xiaodong Wu |
Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions. |
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 | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
Encoding 2D Range Maximum Queries. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer |
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. |
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 | Aviv Nisgav, Boaz Patt-Shamir |
Improved Collaborative Filtering. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wing-Kai Hon, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan |
Succinct Indexes for Circular Patterns. |
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 | Meng He, J. Ian Munro, Gelin Zhou |
Path Queries in Weighted Trees. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")