| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marek Karpinski, Richard Schmied |
Improved Inapproximability Results for the Shortest Superstring and Related Problems.  |
CATS  |
2013 |
DBLP BibTeX RDF |
|
| 1 | Peter Brass, Christian Knauer, Chan-Su Shin, Michiel H. M. Smid, Ivo Vigan |
Range-Aggregate Queries for Geometric Extent Problems. |
CATS |
2013 |
DBLP BibTeX RDF |
|
| 1 | James Harland |
Busy Beaver Machines and the Observant Otter Heuristic. |
CATS |
2013 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Anthony Wirth (eds.) |
Nineteenth Computing: The Australasian Theory Symposium, CATS 2013, Adelaide, Australia, February 2013 |
CATS |
2013 |
DBLP BibTeX RDF |
|
| 1 | Franky Lam, Raymond K. Wong 0001 |
Rotated Library Sort. |
CATS |
2013 |
DBLP BibTeX RDF |
|
| 1 | Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi, Xiao Zhou 0001 |
Complexity of Counting Output Patterns of Logic Circuits. |
CATS |
2013 |
DBLP BibTeX RDF |
|
| 1 | Naonori Kakimura, Mizuyo Takamatsu |
Matching Problems with Delta-Matroid Constraints. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Pavel Valtr 0001 |
On empty pentagons and hexagons in planar point sets. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, David R. Wood |
Cliques in Odd-Minor-Free Graphs. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Cong Zhang, Hiroshi Nagamochi |
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Lee Naish, Harald Søndergaard, Benjamin Horsfall |
Logic Programming: From Underspecification to Undefinedness. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu |
Solving infinite games on trees with back-edges. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Franz-Josef Brandenburg |
On the Curve Complexity of Upward Planar Drawings. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Oslen |
On Defining and Computing Communities. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos |
Quickest Path Queries on Transportation Network. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yung H. Tsin |
Decomposing a Multigraph into Split Components. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Toshihiro Fujito, Takayoshi Sakamaki |
How to guard a graph against tree movements. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Tadao Takaoka |
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Julián Mestre (eds.) |
Eighteenth Computing: The Australasian Theory Symposium, CATS 2012, Melbourne, Australia, January 2012 |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Chuzo Iwamoto, Kento Sasaki, Kenichi Morita |
Computational Complexity of String Puzzles. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen |
The Weak-Heap Family of Priority Queues in Theory and Praxis. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001 |
Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Toshimasa Ishii |
Augmenting Outerplanar Graphs to Meet Diameter Requirements. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah |
Counting paths in planar width 2 branching programs. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Kewen Liao, Hong Shen 0001 |
Approximating the Reliable Resource Allocation Problem Using Inverse Dual Fitting. |
CATS |
2012 |
DBLP BibTeX RDF |
|
| 1 | Alexandra Kolla, James Lee |
Sparsest Cut on Quotients of the Hypercube. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Simon Ware, Robi Malik |
A Process-Algebraic Semantics for Generalised Nonblocking. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alex Potanin, Taso Viglas (eds.) |
Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011 |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Aniruddh Gandhi, Nan Rosemary Ke, Bakhadyr Khoussainov |
Descriptional Complexity of Determinization and Complementation for Finite Automata. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | John Augustine, Qi Han 0001, Philip Loden, Sachin Lodha, Sasanka Roy |
Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yoshiaki Nonaka, Hirotaka Ono 0001, Shuji Kijima, Masafumi Yamashita |
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Peter Floderus, Andrzej Lingas, Mia Persson |
Towards More Efficient Infection and Fire Fighting. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, N. Sadagopan |
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil |
Black-and-White Threshold Graphs. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Paraschos Koutris, Aris Pagourtzis |
Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Tomomi Matsui |
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eiji Miyano, Hirotaka Ono 0001 |
Maximum Domination Problem. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Maram Alnafie, Igor Chikalov, Shahid Hussain 0004, Mikhail Ju. Moshkov |
Sequential Optimization of Binary Search Trees for Multiple Cost Functions. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | James Harland |
Towards Methods for Discovering Universal Turing Machines (or How Universal Unicorns can be Discovered, not Created). |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Dinneen, Masoud Khosravani |
Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette |
Minimum Mosaic Inference of a Set of Recombinants. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gianfranco Bilardi, Carlo Fantozzi |
New Area-Time Lower Bounds for the Multidimensional DFT. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Akira Suzuki, Kei Uchizawa, Xiao Zhou 0001 |
Energy-Efficient Threshold Circuits Computing Mod Functions. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson |
Faster Approximation Algorithms for Scheduling with Fixed Jobs. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tadao Takaoka, Mashitoh Hashim |
Sharing Information in All Pairs Shortest Path Algorithms. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | John Christopher McCabe-Dansted |
On the Succinctness of RoCTL*. |
CATS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege |
A Fixed-Parameter Algorithm for String-to-String Correction. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano |
On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Johnson, Stefano Kasangian |
A Relational Model of Incomplete Data without NULLs. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang 0008 |
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Jörg Rothe |
Control Complexity in Fallback Voting. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zhou Xu 0001, Liang Xu |
Approximation Algorithms for Min-Max Capacitated Path Covers. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Simon Doherty, Lindsay Groves |
Simpler Backward Simulation Proofs. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
Advances on the List Stubborn Problem. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ling-Ju Hung, Ton Kloks |
Kruskalian Graphs. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Peter Finderup, Hans Hüttel, Jakob Svane Knudsen, Johannes Garm Nielsen |
Linear Uniform Receptiveness in a Pi-Calculus with Location Failures. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith |
Probe Distance-Hereditary Graphs. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle |
Notes on Large Angle Crossing Graphs. |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Taso Viglas, Alex Potanin (eds.) |
Theory of Computing 2010, CATS 2010, Brisbane, Australia, January 2010 |
CATS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sumit Ganguly |
Distributing Frequency-Dependent Data Stream Computations. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting |
Boolean Affine Approximation with Binary Decision Diagrams. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vladimir Estivill-Castro, Mahdi Parsa |
Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andras Farago |
Structural Properties of Random Graph Models. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jing Cao, Albert Nymeyer |
Formal Model of a Protocol Converter. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Koji Nakazawa, Makoto Tatsuta |
Type Checking and Inference for Polymorphic and Existential Types. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Day |
On Process Complexity. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara |
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark Utting, Petra Malik, Ian Toyn |
Transformation Rules for Z. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rod Downey, Prabhu Manyem (eds.) |
Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009 |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kira Vyatkina |
Linear Axis for Planar Straight Line Graphs. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | David J. Pearce 0001, Gary Haggard, Gordon F. Royle |
Edge-Selection Heuristics for Computing Tutte Polynomials. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar |
Longest Paths in Planar DAGs in Unambiguous Logspace. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Toshimasa Ishii, Kazuhisa Makino |
Augmenting Edge-Connectivity between Vertex Subsets. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ukachukwu Ndukwu, Jeff W. Sanders |
Reasoning about a Distributed Probabilistic System. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hideaki Fukuhara, Eiji Takimoto |
Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ching-Lueh Chang, Yuh-Dauh Lyuu |
Spreading of Messages in Random Graphs. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mehdi Karimi 0001, Arvind Gupta |
Minimum Cost Homomorphism to Oriented Cycles with Some Loops. |
CATS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vadim E. Levit, Eugen Mandrescu |
Well-covered Graphs and Greedoids. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Olga Ohrimenko, Peter J. Stuckey |
Modelling for Lazy Clause Generation. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Frank Ruskey, Aaron Williams |
Generating Balanced Parentheses and Binary Trees by Prefix Shifts. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender |
Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds? |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shi Bai 0001, Richard P. Brent |
On the Efficiency of Pollard's Rho Method for Discrete Logarithms. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono 0001 |
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Tractable Cases of the Extended Global Cardinality Constraint. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | James Harland, Prabhu Manyem (eds.) |
Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin W. Bunder |
The Inhabitation Problem for Intersection Types. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Lindsay Groves |
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Luke Mathieson, Stefan Szeider |
The Parameterized Complexity of Regular Subgraph Problems and Generalizations. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Matthew Asquith, Joachim Gudmundsson, Damian Merrick |
An ILP for the metro-line crossing problem. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Xiaowei Huang 0001, Li Jiao, Weiming Lu |
Weak Parametric Failure Equivalences and Their Congruence Formats. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nita H. Shah, Ajay S. Gor, Hui Wee |
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Samuel J. Huston, Jakob Puchinger, Peter J. Stuckey |
The Core Concept for 0/1 Integer Programming. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Elena Morozova |
A Multidimensional Bisection Method for Unconstrained Minimization Problem. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ching-Lueh Chang, Yen-Wu Ti, Yuh-Dauh Lyuu |
Testing Embeddability Between Metric Spaces. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-Villavicencio |
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Egbert Mujuni, Frances A. Rosamond |
Parameterized Complexity of the Clique Partition Problem. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tom Coleman, Vanessa Teague |
On The Complexity of Manipulating Elections. |
CATS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Otfried Cheong, Herman J. Haverkort, Mira Lee |
Computing a Minimum-Dilation Spanning Tree is NP-hard. |
CATS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Peter Morris, Thorsten Altenkirch, Neil Ghani |
Constructing Strictly Positive Families. |
CATS |
2007 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license