Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd ISAAC 2012: Taipei, Taiwan
- Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee:
Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7676, Springer 2012, ISBN 978-3-642-35260-7
Invited Talk (I)
- John E. Hopcroft:
Future Directions in Computer Science Research. 1
Invited Talk (II)
- Timothy M. Chan:
Combinatorial Geometry and Approximation Algorithms. 2
Invited Talk (III)
- Erik D. Demaine:
Origami Robots and Star Trek Replicators. 3
Graph Algorithms (I)
- Panagiotis Cheilaris, Luisa Gargano
, Adele A. Rescigno, Shakhar Smorodinsky:
Strong Conflict-Free Coloring for Intervals. 4-13 - Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. 14-23 - Ching-Chen Kuo, Hsueh-I Lu:
Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. 24-33 - Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of List L(2, 1)-Labelings in a Graph. 34-43
Online and Streaming Algorithms
- Prudence W. H. Wong, Fencol C. C. Yung, Mihai Burcea:
An 8/3 Lower Bound for Online Dynamic Bin Packing. 44-53 - Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son:
Computing k-center over Streaming Data for Small k. 54-63 - Sumit Ganguly:
Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams. 64-74 - Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner:
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. 75-84
Combinatorial Optimization (I)
- Nanao Kita:
A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings. 85-94 - Tanja Hartmann, Dorothea Wagner:
Fast and Simple Fully-Dynamic Cut Tree Construction. 95-105 - Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Green Scheduling, Flows and Matchings. 106-115 - Katarzyna E. Paluch:
Popular and Clan-Popular b-Matchings. 116-125
Computational Complexity (I)
- Jiong Guo, Yash Raj Shrestha:
Kernelization and Parameterized Complexity of Star Editing and Union Editing. 126-135 - Reza Dorrigiv, Meng He, Norbert Zeh:
On the Advice Complexity of Buffer Management. 136-145 - Tatsuya Akutsu, Takeyuki Tamura:
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. 146-155 - Andrej Brodnik, Marko Grgurovic:
Speeding Up Shortest Path Algorithms. 156-165
Computational Geometry (I)
- Marc J. van Kreveld, Maarten Löffler, János Pach:
How Many Potatoes Are in a Mesh? 166-176 - Evanthia Papadopoulou, Maksym Zavershynskyi:
On Higher Order Voronoi Diagrams of Line Segments. 177-186 - Evanthia Papadopoulou, Sandeep K. Dey:
On the Farthest Line-Segment Voronoi Diagram. 187-196
String Algorithms
- Yoshifumi Sakai:
Computing the Longest Common Subsequence of Two Run-Length Encoded Strings. 197-206 - Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Counting of Square Substrings in a Tree. 207-216 - Riku Saikkonen, Eljas Soisalon-Soininen:
A General Method for Improving Insertion-Based Adaptive Sorting. 217-226
Computational Complexity (II)
- Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi:
Counting Partitions of Graphs. 227-236 - Tomoyuki Yamakami:
Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs. 237-246 - René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval Scheduling and Colorful Independent Sets. 247-256 - Chinmoy Dutta, Jaikumar Radhakrishnan:
More on a Problem of Zarankiewicz. 257-266
Graph Algorithms (II)
- Andreas Brandstädt, Arne Leitert, Dieter Rautenbach:
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. 267-277 - Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney:
On the Hyperbolicity of Small-World and Tree-Like Random Graphs. 278-288 - 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. 289-298 - Rémy Belmonte, Pim van 't Hof, Marcin Kaminski:
Induced Immersions. 299-308
Computational Geometry (II)
- Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa:
Rectilinear Covering for Imprecise Input Points - (Extended Abstract). 309-318 - Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust Nonparametric Data Approximation of Point Sets via Data Reduction. 319-331 - Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. 332-341 - Yunlong Liu, Xiaodong Wu:
Solving Circular Integral Block Decomposition in Polynomial Time. 342-351
Approximation Algorithms
- Yamming Huang, Chung-Shou Liao:
The Canadian Traveller Problem Revisited. 352-361 - Wei Yu, Mordecai J. Golin, Guochuan Zhang:
Vehicle Scheduling on a Graph Revisited. 362-371 - 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. 372-381 - Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. 382-391
Graph Algorithms (III)
- Norie Fu:
A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs. 392-401 - Tanja Hartmann, Jonathan Rollin, Ignaz Rutter:
Cubic Augmentation of Planar Graphs. 402-412 - Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the Number of Upward Planar Orientations of Maximal Planar Graphs. 413-422 - Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto:
Universal Point Subsets for Planar Graphs. 423-432
Computational Complexity (III)
- Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. 433-443 - Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending Partial Representations of Subclasses of Chordal Graphs. 444-454 - Yota Otachi:
Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. 455-464 - Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. 465-474
Graph Drawing
- Hiroshi Nagamochi:
Linear Layouts in Submodular Systems. 475-484 - Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata:
Segmental Mapping and Distance for Rooted Labeled Ordered Trees. 485-494 - Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Detecting Induced Minors in AT-Free Graphs. 495-505 - Yann Disser, Jannik Matuschke:
Degree-Constrained Orientations of Embedded Graphs. 506-516 - Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe:
Interval Graph Representation with Given Interval and Intersection Lengths. 517-526
Data Structures
- Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen:
Finger Search in the Implicit Model. 527-536 - Meng He, J. Ian Munro, Gelin Zhou:
A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. 537-547 - Meng He, Patrick K. Nicholson, Norbert Zeh:
A Space-Efficient Framework for Dynamic Point Location. 548-557 - Tsvi Kopelowitz, Nimrod Talmon:
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. 558-567 - Christos Makris, Konstantinos Tsakalidis:
An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine. 568-577
Combinatorial Optimization (II)
- Hung-I Yu, Cheng-Chung Li:
The Multi-Service Center Problem. 578-587 - Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. 588-597 - Akitoshi Kawamura, Yusuke Kobayashi:
Fence Patrolling by Mobile Agents with Distinct Speeds. 598-608
Computational Geometry (III)
- Danny Z. Chen, Haitao Wang:
Weak Visibility Queries of Line Segments in Simple Polygons. 609-618 - Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski:
Beyond Homothetic Polygons: Recognition and Maximum Clique. 619-628 - Sang Won Bae, Yoshio Okamoto, Chan-Su Shin:
Area Bounds of Rectilinear Polygons Realized by Angle Sequences. 629-638
Randomized Algorithms
- François Le Gall:
A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. 639-648 - Arya Mazumdar:
On Almost Disjunct Matrices for Group Testing. 649-658 - Tobias Friedrich, Anton Krohmer:
Parameterized Clique on Scale-Free Networks. 659-668
Algorithmic Game Theory
- H. F. Ting, Xiangzhong Xiang:
Multi-unit Auctions with Budgets and Non-uniform Valuations. 669-678 - Takeaki Uno:
Efficient Computation of Power Indices for Weighted Majority Games. 679-689 - Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang:
Revenue Maximization in a Bayesian Double Auction Market. 690-699
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
