default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCATS 2012: Melbourne, Victoria, Australia
- Julián Mestre:
Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012. CRPIT 128, Australian Computer Society 2012, ISBN 978-1-921770-09-8 - Yung H. Tsin:
Decomposing a Multigraph into Split Components. 3-12 - Cong Zhang, Hiroshi Nagamochi:
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. 13-20 - Tadao Takaoka:
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. 21-26 - Franz-Josef Brandenburg:
On the Curve Complexity of Upward Planar Drawings. 27-36 - Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest Path Queries on Transportation Network. 37-46 - Pavel Valtr:
On empty pentagons and hexagons in planar point sets. 47-48 - Lee Naish, Harald Søndergaard, Benjamin Horsfall:
Logic Programming: From Underspecification to Undefinedness. 49-58 - Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah:
Counting paths in planar width 2 branching programs. 59-68 - Chuzo Iwamoto, Kento Sasaki, Kenichi Morita:
Computational Complexity of String Puzzles. 69-74 - Kewen Liao, Hong Shen:
Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting. 75-82 - Naonori Kakimura, Mizuyo Takamatsu:
Matching Problems with Delta-Matroid Constraints. 83-92 - Toshihiro Fujito, Takayoshi Sakamaki:
How to guard a graph against tree movements. 93-96 - Martin Olsen:
On Defining and Computing Communities. 97-102 - Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
The Weak-Heap Family of Priority Queues in Theory and Praxis. 103-112 - Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
Solving infinite games on trees with back-edges. 113-122 - Toshimasa Ishii:
Augmenting Outerplanar Graphs to Meet Diameter Requirements. 123-132 - Ken-ichi Kawarabayashi, David R. Wood:
Cliques in Odd-Minor-Free Graphs. 133-138 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. 139-146
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 2026-03-28 22:20 CET 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:
