ACiD - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2006

On the Maximum Cut ProblemWalid Ben-Ameur. acid 2006: 154

Kernelization for Convex RecoloringHans Leo Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer. acid 2006: 23-35

Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UKHajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider, editors, Volume 7 of Texts in Algorithmics, King s College, London, 2006.

Matrix Robustness, with an Application to Power System ObservabilityMatthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier. acid 2006: 37-48

Finding Paths between ColouringsLuis Cereceda. acid 2006: 155

Parameterized Enumerability for the Database TheoristFouad B. Chedid. acid 2006: 49-56

Sampling Eulerian Orientations of the TrianglePáidí J. Creed. acid 2006: 57-68

Vertex and Edge Covers with Clustering Properties: Complexity and AlgorithmsHenning Fernau, David Manlove. acid 2006: 69-84

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start TimesDaya Ram Gaur, Ramesh Krishnamurti, Ján Manuch. acid 2006: 85-94

Stable Marriage with Ties and Bounded Length Preference ListsRobert W. Irving, David Manlove, Gregg O Malley. acid 2006: 95-106

Parametric Polynomial Time Perceptron Rescaling AlgorithmAndriy Kharechko. acid 2006: 157

Proof Complexity GeneratorsJan Krajícek. acid 2006: 3

A Parameterized View on Matroid Optimization ProblemsDániel Marx. acid 2006: 158

Parameterized Complexity of Finding Regular Induced SubgraphsHannes Moser, Dimitrios M. Thilikos. acid 2006: 107-118

A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic TimeSofya Poger, Yoram J. Sussmann. acid 2006: 119-130

A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3Igor Razgon. acid 2006: 131-142

New Code Bounds with Algebra and Semidefinite ProgrammingAlexander Schrijver. acid 2006: 5

Short Pursuit-EvasionAllan Scott. acid 2006: 143-152

Trees, Grids and Matroids: Observations on Logical Ways to Avoid ComplexityDetlef Seese. acid 2006: 7

On the Complexity of Ordered ColouringsJan van den Heuvel. acid 2006: 156

Congestion Games: Optimization in CompetitionBerthold Vöcking. acid 2006: 9-20

Extremal Sequence TheoryTaoyang Wu. acid 2006: 159

The Computer System GRAPHOGRAPHVadim E. Zverovich. acid 2006: 160

2005

Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk DimensionFaisal N. Abu-Khzam, Michael A. Langston. acid 2005: 59-67

Asymptotically Faster Algorithms for Parameterized FACE COVERFaisal N. Abu-Khzam, Henning Fernau, Michael A. Langston. acid 2005: 43-58

Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete DigraphsJørgen Bang-Jensen, Gregory Gutin, Anders Yeo. acid 2005: 81-94

Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UKHajo Broersma, Matthew Johnson 0002, Stefan Szeider, editors, Volume 4 of Texts in Algorithmics, King s College, London, 2005.

FPT is P-Time Extremal Structure IVladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond. acid 2005: 1-41

Optimal On-Line Bin Packing with Two Item SizesGregory Gutin, Tommy R. Jensen, Anders Yeo. acid 2005: 95-103

Fixed Parameter Set Splitting, Linear Kernel and Improved Running TimeDaniel Lokshtanov, Christian Sloper. acid 2005: 105-113

Student-Project Allocation with Preferences over ProjectsDavid Manlove, Gregg O Malley. acid 2005: 69-80

An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster SizePetrica C. Pop, Georg Still, Walter Kern. acid 2005: 115-121

Quantum Finite Automata and Weighted AutomataM. V. Panduranga Rao, V. Vinay. acid 2005: 123-134

A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner PointsAndreas Spillner. acid 2005: 135-146

Sign in or sign up to see more results.

runs on WebDSL