Login / Signup
CATS
1998
2002
2008
2013
1998
2013
Keyphrases
Publications
2013
Ho-Leung Chan
,
Sze-Hang Chan
,
Tak Wah Lam
,
Lap-Kei Lee
,
Rongbin Li
,
Chi-Man Liu
Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time.
CATS
(2013)
Peter Brass
,
Christian Knauer
,
Chan-Su Shin
,
Michiel H. M. Smid
,
Ivo Vigan
Range-Aggregate Queries for Geometric Extent Problems.
CATS
(2013)
Marek Karpinski
,
Richard Schmied
Improved Inapproximability Results for the Shortest Superstring and Related Problems.
CATS
(2013)
Franky Lam
,
Raymond K. Wong
Rotated Library Sort.
CATS
(2013)
Kei Uchizawa
,
Zhenghong Wang
,
Hiroki Morizumi
,
Xiao Zhou
Complexity of Counting Output Patterns of Logic Circuits.
CATS
(2013)
James Harland
Busy Beaver Machines and the Observant Otter Heuristic.
CATS
(2013)
volume 141, 2013
Nineteenth Computing: The Australasian Theory Symposium, CATS 2013, Adelaide, Australia, February 2013
CATS
141 (2013)
2012
Franz-Josef Brandenburg
On the Curve Complexity of Upward Planar Drawings.
CATS
(2012)
Yung H. Tsin
Decomposing a Multigraph into Split Components.
CATS
(2012)
Toshihiro Fujito
,
Takayoshi Sakamaki
How to guard a graph against tree movements.
CATS
(2012)
Cong Zhang
,
Hiroshi Nagamochi
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights.
CATS
(2012)
Lee Naish
,
Harald Søndergaard
,
Benjamin Horsfall
Logic Programming: From Underspecification to Undefinedness.
CATS
(2012)
Tadao Takaoka
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs.
CATS
(2012)
Pavel Valtr
On empty pentagons and hexagons in planar point sets.
CATS
(2012)
Meena Mahajan
,
Nitin Saurabh
,
Karteek Sreenivasaiah
Counting paths in planar width 2 branching programs.
CATS
(2012)
Aniruddh Gandhi
,
Bakhadyr Khoussainov
,
Jiamou Liu
Solving infinite games on trees with back-edges.
CATS
(2012)
Kewen Liao
,
Hong Shen
Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting.
CATS
(2012)
Radwa El Shawi
,
Joachim Gudmundsson
,
Christos Levcopoulos
Quickest Path Queries on Transportation Network.
CATS
(2012)
Stefan Edelkamp
,
Amr Elmasry
,
Jyrki Katajainen
The Weak-Heap Family of Priority Queues in Theory and Praxis.
CATS
(2012)
Ken-ichi Kawarabayashi
,
David R. Wood
Cliques in Odd-Minor-Free Graphs.
CATS
(2012)
Naonori Kakimura
,
Mizuyo Takamatsu
Matching Problems with Delta-Matroid Constraints.
CATS
(2012)
Toshimasa Ishii
Augmenting Outerplanar Graphs to Meet Diameter Requirements.
CATS
(2012)
Martin Oslen
On Defining and Computing Communities.
CATS
(2012)
Chuzo Iwamoto
,
Kento Sasaki
,
Kenichi Morita
Computational Complexity of String Puzzles.
CATS
(2012)
Yuichi Asahiro
,
Jesper Jansson
,
Eiji Miyano
,
Hirotaka Ono
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.
CATS
(2012)
volume 128, 2012
Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012
CATS
128 (2012)
2011
Akira Suzuki
,
Kei Uchizawa
,
Xiao Zhou
Energy-Efficient Threshold Circuits Computing Mod Functions.
CATS
(2011)
Gianfranco Bilardi
,
Carlo Fantozzi
New Area-Time Lower Bounds for the Multidimensional DFT.
CATS
(2011)
Yoshiaki Nonaka
,
Hirotaka Ono
,
Shuji Kijima
,
Masafumi Yamashita
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree.
CATS
(2011)
Guillaume Blin
,
Romeo Rizzi
,
Florian Sikora
,
Stéphane Vialette
Minimum Mosaic Inference of a Set of Recombinants.
CATS
(2011)
Naoyuki Kamiyama
,
Tomomi Matsui
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking.
CATS
(2011)
Simon Ware
,
Robi Malik
A Process-Algebraic Semantics for Generalised Nonblocking.
CATS
(2011)
Eiji Miyano
,
Hirotaka Ono
Maximum Domination Problem.
CATS
(2011)
Tadao Takaoka
,
Mashitoh Hashim
Sharing Information in All Pairs Shortest Path Algorithms.
CATS
(2011)
Peter Floderus
,
Andrzej Lingas
,
Mia Persson
Towards More Efficient Infection and Fire Fighting.
CATS
(2011)
Aniruddh Gandhi
,
Nan Rosemary Ke
,
Bakhadyr Khoussainov
Descriptional Complexity of Determinization and Complementation for Finite Automata.
CATS
(2011)
John Christopher McCabe-Dansted
On the Succinctness of RoCTL*.
CATS
(2011)
Paraschos Koutris
,
Aris Pagourtzis
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks.
CATS
(2011)
N. S. Narayanaswamy
,
N. Sadagopan
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.
CATS
(2011)
Michael J. Dinneen
,
Masoud Khosravani
Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees.
CATS
(2011)
Ling-Ju Hung
,
Ton Kloks
,
Fernando Sánchez Villaamil
Black-and-White Threshold Graphs.
CATS
(2011)
John Augustine
,
Qi Han
,
Philip Loden
,
Sachin Lodha
,
Sasanka Roy
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks.
CATS
(2011)
James Harland
Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created).
CATS
(2011)
Alexandra Kolla
,
James Lee
Sparsest Cut on Quotients of the Hypercube.
CATS
(2011)
Klaus Jansen
,
Lars Prädel
,
Ulrich M. Schwarz
,
Ola Svensson
Faster Approximation Algorithms for Scheduling with Fixed Jobs.
CATS
(2011)
Maram Alnafie
,
Igor Chikalov
,
Shahid Hussain
,
Mikhail Ju. Moshkov
Sequential Optimization of Binary Search Trees for Multiple Cost Functions.
CATS
(2011)
volume 119, 2011
Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011
CATS
119 (2011)
2010
Kazuyuki Amano
On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas.
CATS
(2010)
Gábor Erdélyi
,
Jörg Rothe
Control Complexity in Fallback Voting.
CATS
(2010)
volume 109, 2010
Theory of Computing 2010, CATS 2010, Brisbane, Australia, January 2010
CATS
109 (2010)