Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Dominik Scheder |
Unsatisfiable CNF Formulas contain Many Conflicts. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals |
Terrain Visibility with Multiple Viewpoints. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki |
Better Bounds for Online k-Frame Throughput Maximization in Network Switches. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sam Walker, Yakov Zinder |
The Solvable Cases of a Scheduling Algorithm. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Darja Krushevskaja, S. Muthukrishnan 0001 |
Market Approach to Social Ads: The MyLikes Example and Related Problems. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson |
Augmenting Graphs to Minimize the Diameter. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Wolfgang Mulzer, Yannik Stein |
Algorithms for Tolerated Tverberg Partitions. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber |
Geodesic-Preserving Polygon Simplification. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, J. Ian Munro, Venkatesh Raman 0001 |
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam (eds.) |
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Franz Aurenhammer, Gernot Walzl |
Structure and Computation of Straight Skeletons in 3-Space. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Konstantinos Panagiotou, Leo Speidel |
Asynchronous Rumor Spreading on Random Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jiehua Chen 0001, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller |
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Aparna Das, Krzysztof Fleszar 0001, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff 0001 |
Approximating the Generalized Minimum Manhattan Network Problem. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter |
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Youming Qiao, Xiaoming Sun 0001, Nengkun Yu |
Determinantal Complexities and Field Extensions. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Xing Shi Cai, Luc Devroye |
A Probabilistic Analysis of Kademlia Networks. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Xiangzhong Xiang |
New Results on the Online Pricing Problem. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Lars Arge, Mikkel Thorup |
RAM-Efficient External Memory Sorting. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy |
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger |
The Complexity of Finding a Large Subgraph under Anonymity Constraints. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Marc Lelarge, Hang Zhou 0001 |
Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Friedrich Slivovsky, Stefan Szeider |
Model Counting for Formulas of Bounded Clique-Width. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Robert Fraser, Meng He 0001, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson |
The Distance 4-Sector of Two Points Is Unique. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen |
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kazuo Murota, Akiyoshi Shioura, Zaifu Yang |
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Marek Karpinski, Michael Lampis, Richard Schmied |
New Inapproximability Bounds for TSP. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Dominik Scheder |
Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Patrizio Angelini, Thomas Bläsius, Ignaz Rutter |
Testing Mutual Duality of Planar Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Jing Chen, He Guo 0001, Xin Han, Kazuo Iwama |
The Train Delivery Problem Revisited. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Yota Otachi, Pascal Schweitzer |
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Martin Balko, Pavel Klavík, Yota Otachi |
Bounded Representations of Interval and Proper Interval Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Angsheng Li, Pan Peng 0001 |
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki |
Computing Minimum Tile Sets to Self-Assemble Color Patterns. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Kevin Buchin, Dirk H. P. Gerrits |
Dynamic Point Labeling is Strongly PSPACE-Complete. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Qi Cheng 0001, Jiyou Li, Jincheng Zhuang |
On Determining Deep Holes of Generalized Reed-Solomon Codes. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Sergey Bereg, Seok-Hee Hong 0001, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa |
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Moni Naor, Eylon Yogev |
Sliding Bloom Filters. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl |
Cops and Robbers on Intersection Graphs. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Gonzalo Navarro 0001, Sharma V. Thankachan |
Top-k Document Retrieval in Compact Space and Near-Optimal Time. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Haitao Wang 0001 |
Minmax Regret 1-Facility Location on Uncertain Path Networks. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Michael Etscheid |
Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman 0001 |
Succinct Data Structures for Representing Equivalence Classes. |
ISAAC |
2013 |
DBLP DOI BibTeX RDF |
|
1 | Tanja Hartmann, Dorothea Wagner |
Fast and Simple Fully-Dynamic Cut Tree Construction. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Arya Mazumdar |
On Almost Disjunct Matrices for Group Testing. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Wei Yu 0010, Mordecai J. Golin, Guochuan Zhang |
Vehicle Scheduling on a Graph Revisited. |
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 | 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 | Danny Z. Chen, Xuehou Tan, Haitao Wang 0001, Gangshan Wu |
Optimal Point Movement for Covering Circular Regions. |
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 | 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 | Rémy Belmonte, Pim van 't Hof, Marcin Kaminski 0001 |
Induced Immersions. |
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 | 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 | Danny Z. Chen, Haitao Wang 0001 |
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 | Wei Chen 0013, 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 | Fabrizio Frati, Joachim Gudmundsson, Emo Welzl |
On the Number of Upward Planar Orientations of Maximal Planar Graphs. |
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 | Takehiro Ito, Kazuto Kawamura, Hirotaka Ono 0001, Xiao Zhou 0001 |
Reconfiguration of List L(2, 1)-Labelings in a Graph. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Chinmoy Dutta, Jaikumar Radhakrishnan |
More on a Problem of Zarankiewicz. |
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 | Xiaotie Deng, Paul W. Goldberg, Bo Tang 0010, Jinshan Zhang 0001 |
Revenue Maximization in a Bayesian Double Auction Market. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Reza Dorrigiv, Meng He 0001, Norbert Zeh |
On the Advice Complexity of Buffer Management. |
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 | Takeaki Uno |
Efficient Computation of Power Indices for Weighted Majority Games. |
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 | 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 | Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi |
Counting Partitions of Graphs. |
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 | Katarzyna E. Paluch 0001 |
Popular and Clan-Popular b-Matchings. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Meng He 0001, Patrick K. Nicholson, Norbert Zeh |
A Space-Efficient Framework for Dynamic Point Location. |
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 | Christos Makris, Konstantinos Tsakalidis |
An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine. |
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 | Akitoshi Kawamura, Yusuke Kobayashi 0001 |
Fence Patrolling by Mobile Agents with Distinct Speeds. |
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 | Sumit Ganguly |
Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Yann Disser, Jannik Matuschke |
Degree-Constrained Orientations of Embedded Graphs. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim 0001, Wanbin Son |
Computing k-center over Streaming Data for Small k. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan |
Combinatorial Geometry and Approximation Algorithms. |
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 | Yamming Huang, Chung-Shou Liao |
The Canadian Traveller Problem Revisited. |
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 | Hiroshi Nagamochi |
Linear Layouts in Submodular Systems. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Erik D. Demaine |
Origami Robots and Star Trek Replicators. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Petr A. Golovach, Daniël Paulusma, Jian Song 0005 |
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. |
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 | 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 | Tobias Friedrich 0001, Anton Krohmer |
Parameterized Clique on Scale-Free Networks. |
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 | H. F. Ting, Xiangzhong Xiang |
Multi-unit Auctions with Budgets and Non-uniform Valuations. |
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 | Meng He 0001, J. Ian Munro, Gelin Zhou |
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe 0001 |
Interval Graph Representation with Given Interval and Intersection Lengths. |
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 | Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa |
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). |
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 | Evanthia Papadopoulou, Maksym Zavershynskyi |
On Higher Order Voronoi Diagrams of Line Segments. |
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 |
|