researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
1998
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
Filter by Tag
[+]
OR
AND
NOT
1
Meta-Environment
abstraction
analysis
caching
completeness
composition
constraints
data-flow
design
e-science
graph-rewriting
laziness
logic
open-source
partitioning
programming
protocol
rewriting
rule-based
source-to-source
Filter by Author
[+]
OR
AND
NOT
1
Amr Elmasry
Andrzej Lingas
Aniruddh Gandhi
Bakhadyr Khoussainov
Chan-Su Shin
Eiji Miyano
Harald Søndergaard
Hing-Fung Ting
Hiroshi Nagamochi
Hirotaka Ono
James Harland
Jesper Jansson
Joachim Gudmundsson
Jyrki Katajainen
Ling-Ju Hung
Mia Persson
Tadao Takaoka
Tak Wah Lam
Toshimasa Ishii
Yuichi Asahiro
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
australasian
australia
cats
complexity
computing
efficient
graph
graphs
january
line
minimum
path
problem
problems
symposium
theory
time
trees
CATS (cats)
Editions
Publications
Viewing Publication 1 - 100 from 180
2013
Range-Aggregate Queries for Geometric Extent Problems
Peter Brass
,
Christian Knauer
,
Chan-Su Shin
,
Michiel H. M. Smid
.
cats 2013
:
3-10
[doi]
Competitive Online Algorithms for Multiple-Machine Power Management and Weighted Flow Time
Ho-Leung Chan
,
Sze-Hang Chan
,
Tak Wah Lam
,
Lap-Kei Lee
,
Rongbin Li
,
Chi-Man Liu
.
cats 2013
:
11-20
[doi]
Busy Beaver Machines and the Observant Otter Heuristic
James Harland
.
cats 2013
:
53-52
[doi]
Improved Inapproximability Results for the Shortest Superstring and Related Problems
Marek Karpinski
,
Richard Schmied
.
cats 2013
:
27-36
[doi]
Rotated Library Sort
Franky Lam
,
Raymond K. Wong
.
cats 2013
:
21-26
[doi]
Complexity of Counting Output Patterns of Logic Circuits
Kei Uchizawa
,
Zhenghong Wang
,
Hiroki Morizumi
,
Xiao Zhou
.
cats 2013
:
37-43
[doi]
Nineteenth Computing: The Australasian Theory Symposium, CATS 2013, Adelaide, Australia, February 2013
Anthony Wirth
, editor,
Volume 141 of
CRPIT
, Australian Computer Society,
2013.
[doi]
2012
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty
Yuichi Asahiro
,
Jesper Jansson
,
Eiji Miyano
,
Hirotaka Ono
.
cats 2012
:
139-146
[doi]
On the Curve Complexity of Upward Planar Drawings
Franz-Josef Brandenburg
.
cats 2012
:
27-36
[doi]
The Weak-Heap Family of Priority Queues in Theory and Praxis
Stefan Edelkamp
,
Amr Elmasry
,
Jyrki Katajainen
.
cats 2012
:
103-112
[doi]
How to guard a graph against tree movements
Toshihiro Fujito
,
Takayoshi Sakamaki
.
cats 2012
:
93-96
[doi]
Solving infinite games on trees with back-edges
Aniruddh Gandhi
,
Bakhadyr Khoussainov
,
Jiamou Liu
.
cats 2012
:
113-122
[doi]
Augmenting Outerplanar Graphs to Meet Diameter Requirements
Toshimasa Ishii
.
cats 2012
:
123-132
[doi]
Computational Complexity of String Puzzles
Chuzo Iwamoto
,
Kento Sasaki
,
Kenichi Morita
.
cats 2012
:
69-74
[doi]
Matching Problems with Delta-Matroid Constraints
Naonori Kakimura
,
Mizuyo Takamatsu
.
cats 2012
:
83-92
[doi]
Cliques in Odd-Minor-Free Graphs
Ken-ichi Kawarabayashi
,
David R. Wood
.
cats 2012
:
133-138
[doi]
Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting
Kewen Liao
,
Hong Shen
.
cats 2012
:
75-82
[doi]
Counting paths in planar width 2 branching programs
Meena Mahajan
,
Nitin Saurabh
,
Karteek Sreenivasaiah
.
cats 2012
:
59-68
[doi]
Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012
Julián Mestre
, editor,
Volume 128 of
CRPIT
, Australian Computer Society,
2012.
[doi]
Logic Programming: From Underspecification to Undefinedness
Lee Naish
,
Harald Søndergaard
,
Benjamin Horsfall
.
cats 2012
:
49-58
[doi]
On Defining and Computing Communities
Martin Oslen
.
cats 2012
:
97-102
[doi]
Quickest Path Queries on Transportation Network
Radwa El Shawi
,
Joachim Gudmundsson
,
Christos Levcopoulos
.
cats 2012
:
37-46
[doi]
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs
Tadao Takaoka
.
cats 2012
:
21-26
[doi]
Decomposing a Multigraph into Split Components
Yung H. Tsin
.
cats 2012
:
3-12
[doi]
On empty pentagons and hexagons in planar point sets
Pavel Valtr
.
cats 2012
:
47-48
[doi]
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
Cong Zhang
,
Hiroshi Nagamochi
.
cats 2012
:
13-20
[doi]
2011
Sequential Optimization of Binary Search Trees for Multiple Cost Functions
Maram Alnafie
,
Igor Chikalov
,
Shahid Hussain
,
Mikhail Ju. Moshkov
.
cats 2011
:
41-44
[doi]
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks
John Augustine
,
Qi Han
,
Philip Loden
,
Sachin Lodha
,
Sasanka Roy
.
cats 2011
:
31-40
[doi]
New Area-Time Lower Bounds for the Multidimensional DFT
Gianfranco Bilardi
,
Carlo Fantozzi
.
cats 2011
:
111-120
[doi]
Minimum Mosaic Inference of a Set of Recombinants
Guillaume Blin
,
Romeo Rizzi
,
Florian Sikora
,
Stéphane Vialette
.
cats 2011
:
23-30
[doi]
Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees
Michael J. Dinneen
,
Masoud Khosravani
.
cats 2011
:
145-150
[doi]
Towards More Efficient Infection and Fire Fighting
Peter Floderus
,
Andrzej Lingas
,
Mia Persson
.
cats 2011
:
69-74
[doi]
Descriptional Complexity of Determinization and Complementation for Finite Automata
Aniruddh Gandhi
,
Nan Rosemary Ke
,
Bakhadyr Khoussainov
.
cats 2011
:
95-104
[doi]
Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created)
James Harland
.
cats 2011
:
151-160
[doi]
Black-and-White Threshold Graphs
Ling-Ju Hung
,
Ton Kloks
,
Fernando Sanchez Villaamil
.
cats 2011
:
121-130
[doi]
Faster Approximation Algorithms for Scheduling with Fixed Jobs
Klaus Jansen
,
Lars Prädel
,
Ulrich M. Schwarz
,
Ola Svensson
.
cats 2011
:
3-10
[doi]
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking
Naoyuki Kamiyama
,
Tomomi Matsui
.
cats 2011
:
137-144
[doi]
Sparsest Cut on Quotients of the Hypercube
Alexandra Kolla
,
James Lee
.
cats 2011
:
11-22
[doi]
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks
Paraschos Koutris
,
Aris Pagourtzis
.
cats 2011
:
161-168
[doi]
On the Succinctness of RoCTL*
John Christopher McCabe-Dansted
.
cats 2011
:
85-94
[doi]
Maximum Domination Problem
Eiji Miyano
,
Hirotaka Ono
.
cats 2011
:
55-62
[doi]
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation
N. S. Narayanaswamy
,
N. Sadagopan
.
cats 2011
:
45-54
[doi]
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree
Yoshiaki Nonaka
,
Hirotaka Ono
,
Shuji Kijima
,
Masafumi Yamashita
.
cats 2011
:
63-68
[doi]
Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011
Alex Potanin
,
Taso Viglas
, editors,
Volume 119 of
CRPIT
, Australian Computer Society,
2011.
[doi]
Energy-Efficient Threshold Circuits Computing Mod Functions
Akira Suzuki
,
Kei Uchizawa
,
Xiao Zhou
.
cats 2011
:
105-110
[doi]
Sharing Information in All Pairs Shortest Path Algorithms
Tadao Takaoka
,
Mashitoh Hashim
.
cats 2011
:
131-136
[doi]
A Process-Algebraic Semantics for Generalised Nonblocking
Simon Ware
,
Robi Malik
.
cats 2011
:
75-84
[doi]
2010
A Fixed-Parameter Algorithm for String-to-String Correction
Faisal N. Abu-Khzam
,
Henning Fernau
,
Michael A. Langston
,
Serena Lee-Cultura
,
Ulrike Stege
.
cats 2010
:
31-38
[doi]
On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas
Kazuyuki Amano
.
cats 2010
:
25-30
[doi]
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors
Sze-Hang Chan
,
Tak Wah Lam
,
Lap-Kei Lee
,
Hing-Fung Ting
,
Peng Zhang
.
cats 2010
:
3-10
[doi]
Probe Distance-Hereditary Graphs
Maw-Shang Chang
,
Ling-Ju Hung
,
Peter Rossmanith
.
cats 2010
:
55-64
[doi]
Advances on the List Stubborn Problem
Simone Dantas
,
Luerbio Faria
,
C. M. H. de Figueiredo
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
.
cats 2010
:
65-70
[doi]
Simpler Backward Simulation Proofs
Simon Doherty
,
Lindsay Groves
.
cats 2010
:
71-78
[doi]
Notes on Large Angle Crossing Graphs
Vida Dujmovic
,
Joachim Gudmundsson
,
Pat Morin
,
Thomas Wolle
.
cats 2010
:
19-24
[doi]
Control Complexity in Fallback Voting
Gábor Erdélyi
,
Jörg Rothe
.
cats 2010
:
39-48
[doi]
Linear Uniform Receptiveness in a Pi-Calculus with Location Failures
Peter Finderup
,
Hans Hüttel
,
Jakob Svane Knudsen
,
Johannes Garm Nielsen
.
cats 2010
:
79-88
[doi]
Kruskalian Graphs
Ling-Ju Hung
,
Ton Kloks
.
cats 2010
:
49-54
[doi]
A Relational Model of Incomplete Data without NULLs
Michael Johnson
,
Stefano Kasangian
.
cats 2010
:
89-94
[doi]
Theory of Computing 2010, CATS 2010, Brisbane, Australia, January 2010
Taso Viglas
,
Alex Potanin
, editors,
Volume 109 of
CRPIT
, Australian Computer Society,
2010.
[doi]
Approximation Algorithms for Min-Max Capacitated Path Covers
Zhou Xu
,
Liang Xu
.
cats 2010
:
11-18
[doi]
2009
Formal Model of a Protocol Converter
Jing Cao
,
Albert Nymeyer
.
cats 2009
:
107-117
[doi]
Spreading of Messages in Random Graphs
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
.
cats 2009
:
3-7
[doi]
On Process Complexity
Adam R. Day
.
cats 2009
:
29-34
[doi]
Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009
Rod Downey
,
Prabhu Manyem
, editors,
Volume 94 of
CRPIT
, Australian Computer Society,
2009.
[doi]
Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity
Vladimir Estivill-Castro
,
Mahdi Parsa
.
cats 2009
:
81-87
[doi]
Structural Properties of Random Graph Models
Andras Farago
.
cats 2009
:
129-136
[doi]
Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes
Hideaki Fukuhara
,
Eiji Takimoto
.
cats 2009
:
89-98
[doi]
Distributing Frequency-Dependent Data Stream Computations
Sumit Ganguly
.
cats 2009
:
161-167
[doi]
Boolean Affine Approximation with Binary Decision Diagrams
Kevin Henshall
,
Peter Schachte
,
Harald Søndergaard
,
Leigh Whiting
.
cats 2009
:
119-127
[doi]
Augmenting Edge-Connectivity between Vertex Subsets
Toshimasa Ishii
,
Kazuhisa Makino
.
cats 2009
:
43-49
[doi]
Minimum Cost Homomorphism to Oriented Cycles with Some Loops
Mehdi Karimi
,
Arvind Gupta
.
cats 2009
:
7-17
[doi]
Longest Paths in Planar DAGs in Unambiguous Logspace
Nutan Limaye
,
Meena Mahajan
,
Prajakta Nimbhorkar
.
cats 2009
:
99-105
[doi]
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program
Wataru Matsubara
,
Shunsuke Inenaga
,
Ayumi Shinohara
.
cats 2009
:
19-28
[doi]
Type Checking and Inference for Polymorphic and Existential Types
Koji Nakazawa
,
Makoto Tatsuta
.
cats 2009
:
61-69
[doi]
Reasoning about a Distributed Probabilistic System
Ukachukwu Ndukwu
,
Jeff W. Sanders
.
cats 2009
:
35-42
[doi]
Edge-Selection Heuristics for Computing Tutte Polynomials
David J. Pearce
,
Gary Haggard
,
Gordon Royle
.
cats 2009
:
151-159
[doi]
Transformation Rules for Z
Mark Utting
,
Petra Malik
,
Ian Toyn
.
cats 2009
:
71-80
[doi]
Linear Axis for Planar Straight Line Graphs
Kira Vyatkina
.
cats 2009
:
137-150
[doi]
2008
Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds?
Eric Allender
.
cats 2008
:
3
[doi]
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Yuichi Asahiro
,
Eiji Miyano
,
Hirotaka Ono
.
cats 2008
:
97-106
[doi]
An ILP for the metro-line crossing problem
Matthew Asquith
,
Joachim Gudmundsson
,
Damian Merrick
.
cats 2008
:
49-56
[doi]
On the Efficiency of Pollard s Rho Method for Discrete Logarithms
Shi Bai
,
Richard P. Brent
.
cats 2008
:
125-131
[doi]
The Inhabitation Problem for Intersection Types
Martin W. Bunder
.
cats 2008
:
7-14
[doi]
Testing Embeddability Between Metric Spaces
Ching-Lueh Chang
,
Yen-Wu Ti
,
Yuh-Dauh Lyuu
.
cats 2008
:
117-124
[doi]
Verifying Michael and Scott s Lock-Free Queue Algorithm using Trace Reduction
Lindsay Groves
.
cats 2008
:
133-142
[doi]
Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings
James Harland
,
Prabhu Manyem
, editors,
Volume 77 of
CRPIT
, Australian Computer Society,
2008.
Weak Parametric Failure Equivalences and Their Congruence Formats
Xiaowei Huang
,
Li Jiao
,
Weiming Lu
.
cats 2008
:
15-26
[doi]
The Core Concept for 0/1 Integer Programming
Samuel Huston
,
Jakob Puchinger
,
Peter J. Stuckey
.
cats 2008
:
39-47
[doi]
Well-covered Graphs and Greedoids
Vadim E. Levit
,
Eugen Mandrescu
.
cats 2008
:
87-91
[doi]
The Parameterized Complexity of Regular Subgraph Problems and Generalizations
Luke Mathieson
,
Stefan Szeider
.
cats 2008
:
79-86
[doi]
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
Mirka Miller
,
Minh Hoang Nguyen
,
Guillermo Pineda-Villavicencio
.
cats 2008
:
93-95
[doi]
A Multidimensional Bisection Method for Unconstrained Minimization Problem
Elena Morozova
.
cats 2008
:
57-62
[doi]
Parameterized Complexity of the Clique Partition Problem
Egbert Mujuni
,
Frances A. Rosamond
.
cats 2008
:
75-78
[doi]
Modelling for Lazy Clause Generation
Olga Ohrimenko
,
Peter J. Stuckey
.
cats 2008
:
27-37
[doi]
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
Frank Ruskey
,
Aaron Williams
.
cats 2008
:
107-115
[doi]
Tractable Cases of the Extended Global Cardinality Constraint
Marko Samer
,
Stefan Szeider
.
cats 2008
:
67-74
[doi]
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value
Nita H. Shah
,
Ajay S. Gor
,
Hui Wee
.
cats 2008
:
63-66
[doi]
2007
On the Power of Structural Violations in Priority Queues
Amr Elmasry
,
Claus Jensen
,
Jyrki Katajainen
.
cats 2007
:
45-53
[doi]
Some Structural and Geometric Properties of Two-Connected Steiner Networks
K. Hvam
,
L. Reinhardt
,
Pawel Winter
,
Martin Zachariasen
.
cats 2007
:
85-90
[doi]
Effective Prediction and its Computational Complexity
Richard Taylor
.
cats 2007
:
145-151
[doi]
Sign in
or
sign up
to see more results.