| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen |
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.  |
CIAC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ching-Lueh Chang, Yuh-Dauh Lyuu |
Bounding the Number of Tolerable Faults in Majority-Based Systems. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Borut Luzar |
A Planar Linear Arboricity Conjecture. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo A. Baeza-Yates |
Towards a Distributed Search Engine. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Strategic Coloring of a Graph. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira |
On the Number of Higher Order Delaunay Triangulations. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith |
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Woltran |
Multicut Algorithms via Tree Decompositions. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff |
An Exact Algorithm for Connected Red-Blue Dominating Set. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe |
The Complexity of Computing Minimal Unidirectional Covering Sets. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hui Zhang, Qing Guo, Costas S. Iliopoulos |
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová |
Improved Approximations for TSP with Simple Precedence Constraints. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Gilad Tsur |
Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij |
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Josep Díaz (eds.) |
Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
How Simple Robots Benefit from Looking Back. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner |
Preprocessing Speed-Up Techniques Is Hard. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Olsen |
Maximizing PageRank with New Backlinks. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Dressler, Martin Strehler |
Capacitated Confluent Flows: Complexity and Algorithms. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Monika Henzinger |
Mechanisms for the Marriage and the Assignment Game. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen |
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gianni Franceschini, Torben Hagerup |
Finding the Maximum Suffix with Fewer Comparisons. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Biró, Robert W. Irving, David Manlove |
Popular Matchings in the Marriage and Roommates Problems. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk |
Irredundant Set Faster Than O(2n). |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe F. Italiano |
Resilient Algorithms and Data Structures. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Enumerating Rooted Graphs with Reflectional Block Structures. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leizhen Cai, Boting Yang |
Parameterized Complexity of Even/Odd Subgraph Problems. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Janina A. Brenner, Guido Schäfer |
Online Cooperative Cost Sharing. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jen-Hou Chou, Chi-Jen Lu |
Communication Requirements for Stable Marriages. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Cheilaris, Géza Tóth |
Graph Unique-Maximum and Conflict-Free Colorings. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Monien, Tobias Tscheuschner |
On the Power of Nodes of Degree Four in the Local Max-Cut Problem. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger |
A Parameterized Algorithm for Chordal Sandwich. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar |
On Strategy Improvement Algorithms for Simple Stochastic Games. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Gunia |
On Broadcast Scheduling with Limited Energy. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
Mobile and net computing, Algorithms, Computational complexity |
| 1 | Hervé Fournier, Guillaume Malod |
Universal Relations and #P-Completeness. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslav Chlebík, Janka Chlebíková |
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska |
Distributed Approximation Algorithms for Planar Graphs. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Pudlák |
On Search Problems in Complexity Theory and in Logic (Abstract). |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák |
Network Discovery and Verification with Distance Queries. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu |
Gathering Algorithms on Paths Under Interference Constraints. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
interference, path, Gathering, multi-hop radio network |
| 1 | Erez Kantor, David Peleg |
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, Edda Happ |
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Annamária Kovács |
Tighter Approximation Bounds for LPT Scheduling in Two Special Cases. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Fuchs |
On the Hardness of Range Assignment Problems. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi |
Black Hole Search in Asynchronous Rings Using Tokens. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo |
The Linear Arrangement Problem Parameterized Above Guaranteed Value. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Kern, Gerhard J. Woeginger |
Quadratic Programming and Combinatorial Minimum Weight Product Problems. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
shortest path, Quadratic Programming, approximation scheme |
| 1 | Dimitrios Koukopoulos, Stavros D. Nikolopoulos |
Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert |
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hing-Fung Ting |
A Near Optimal Scheduler for On-Demand Data Broadcasts. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Blunck, Jan Vahrenhold |
In-Place Randomized Slope Selection. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Raghav Kulkarni |
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven |
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Dror Rawitz, Shimon Shahar |
Approximation Algorithms for Capacitated Rectangle Stabbing. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Agostino Capponi, Daniël Paulusma |
On-Line Coloring of H-Free Bipartite Graphs. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maik Weinard |
Deciding the FIFO Stability of Networks in Polynomial Time. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Magdalene Grantson, Christos Levcopoulos |
Covering a Set of Points with a Minimum Number of Lines. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming-Yang Kao, Manan Sanghi |
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Chen, Lan Liu, Zheng Liu, Tao Jiang |
On the Minimum Common Integer Partition Problem. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yvonne Bleischwitz, Burkhard Monien |
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano |
How to Pack Directed Acyclic Graphs into Small Blocks. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß |
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.) |
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings |
CIAC |
2006 |
DBLP BibTeX RDF |
|
| 1 | Henning Fernau |
Parameterized Algorithms for Hitting Set: The Weighted Case. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Matching Subsequences in Trees. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Damaschke |
Fixed-Parameter Tractable Generalizations of Cluster Editing. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Franco P. Preparata |
Beware of the Model: Reflections on Algorithmic Research. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Porschen |
Counting All Solutions of Minimum Weight Exact Satisfiability. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
Minimum weight exact satisfiability, minimum weight set partition, counting problem, maximum weight independent set |
| 1 | Kurt Mehlhorn |
Reliable and Efficient Geometric Computing. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan |
Distance Approximating Trees: Complexity and Algorithms. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri (eds.) |
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings |
CIAC |
2003 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
Some Properties of MODm Circuits Computing Simple Functions. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
modular circuits, composite modulus, lower bounds, Fourier analysis, symmetric functions |
| 1 | Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky |
Unlocking the Advantages of Dynamic Service Selection and Pricing. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig |
The Complexity of Detecting Fixed-Density Clusters. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
fixed-parameter problems, computational complexity, graph algorithms, Density-based clustering |
| 1 | David Peleg |
Spanning Trees with Low Maximum/Average Stretch. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman |
Efficient Update Strategies for Geometric Computing with Uncertainty. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino |
Indexing Structures for Approximate String Matching. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
DAWGs, indexing, suffix trees, automata theory, approximate string matching, Combinatorics on words |
| 1 | Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis |
The Impact of Network Structure on the Stability of Greedy Protocols. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Anand Srivastav |
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Integer programming, Multicast routing |
| 1 | Gian Carlo Bongiovanni, Paolo Penna |
XOR-Based Schemes for Fast Parallel IP Lookups. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis |
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | William Duckworth, Bernard Mans |
Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
weakly-connected, dominating sets, random regular graphs |
| 1 | Tomoyuki Yamakami |
Nearly Bounded Error Probabilistic Sets. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan |
Error-Correcting Codes in Complexity Theory. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability |
| 1 | Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
On-Line Stream Merging, Max Span, and Min Coverage. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jayme Luiz Szwarcfiter |
Generating All Forest Extensions of a Partially Ordered Set. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
forests extensions, algorithms, partially ordered sets, forests |
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Differential Approximation for Some Routing Problems. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
differential ratio, approximation algorithm, TSP, VRP |
| 1 | John E. Savage |
Computing with Electronic Nanotechnologies. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Lene M. Favrholdt |
The Relative Worst Order Ratio for On-Line Algorithms. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslav Chlebík, Janka Chlebíková |
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jayme Luiz Szwarcfiter |
Optimal Binary Search Trees with Costs Depending on the Access Paths. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi |
Reconciling Gene Trees to a Species Tree. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael O. Rabin |
Hyper Encryption and Everlasting Secrets. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma |
Approximation of a Retrieval Problem for Parallel Disks. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Chepoi, Feodor F. Dragan, Chenyu Yan |
Additive Spanners for k-Chordal Graphs. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jayme Luiz Szwarcfiter |
On the Generation of Extensions of a Partially Ordered Set. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")