Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/acid/acid2006.bht:"
download as .bib file
@inproceedings{DBLP:conf/acid/Ben-Ameur06,
author = {Walid Ben{-}Ameur},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {On the Maximum Cut Problem},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {154},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
biburl = {https://dblp.org/rec/conf/acid/Ben-Ameur06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/BodlaenderFLRRW06,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael A. Langston and
Mark A. Ragan and
Frances A. Rosamond and
Mark Weyer},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Kernelization for Convex Recoloring},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {23--35},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/BodlaenderFLRRW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/BrosemannAHN06,
author = {Matthias Brosemann and
Jochen Alber and
Falk H{\"{u}}ffner and
Rolf Niedermeier},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Matrix Robustness, with an Application to Power System Observability},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {37--48},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/BrosemannAHN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Cereceda06,
author = {Luis Cereceda},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Finding Paths between Colourings},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {155},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Cereceda06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Chedid06,
author = {Fouad B. Chedid},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Parameterized Enumerability for the Database Theorist},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {49--56},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Chedid06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Creed06,
author = {P{\'{a}}id{\'{\i}} J. Creed},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Sampling Eulerian Orientations of the Triangle},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {57--68},
publisher = {King's College, London},
year = {2006},
timestamp = {Wed, 27 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Creed06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/FernauM06,
author = {Henning Fernau and
David F. Manlove},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Vertex and Edge Covers with Clustering Properties: Complexity and
Algorithms},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {69--84},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/FernauM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/GaurKM06,
author = {Daya Ram Gaur and
Ramesh Krishnamurti and
J{\'{a}}n Manuch},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Improved Approximation Algorithm for Scheduling Tasks with a Choice
of Start Times},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {85--94},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/GaurKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Heuvel06,
author = {Jan van den Heuvel},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {On the Complexity of Ordered Colourings},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {156},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Heuvel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/IrwingMO06,
author = {Robert W. Irving and
David F. Manlove and
Gregg O'Malley},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Stable Marriage with Ties and Bounded Length Preference Lists},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {95--106},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/IrwingMO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Kharechko06,
author = {Andriy Kharechko},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Parametric Polynomial Time Perceptron Rescaling Algorithm},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {157},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Kharechko06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Krajicek06,
author = {Jan Kraj{\'{\i}}cek},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Proof Complexity Generators},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {3},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Krajicek06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Marx06,
author = {D{\'{a}}niel Marx},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {A Parameterized View on Matroid Optimization Problems},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {158},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/MoserT06,
author = {Hannes Moser and
Dimitrios M. Thilikos},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Parameterized Complexity of Finding Regular Induced Subgraphs},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {107--118},
publisher = {King's College, London},
year = {2006},
timestamp = {Wed, 27 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/MoserT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/PogerS06,
author = {Sofya Poger and
Yoram J. Sussmann},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {A Delta-Wye-Delta Reduction for Planar Grid Graphs in Subquadratic
Time},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {119--130},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/PogerS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Razgon06,
author = {Igor Razgon},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {A Faster Solving of the Maximum Independent Set Problem for Graphs
with Maximal Degree 3},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {131--142},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Razgon06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Schrijver06,
author = {Alexander Schrijver},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {New Code Bounds with Algebra and Semidefinite Programming},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {5},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Schrijver06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Scott06,
author = {Allan Scott},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Short Pursuit-Evasion},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {143--152},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Scott06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Seese06,
author = {Detlef Seese},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {7},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Seese06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Vocking06,
author = {Berthold V{\"{o}}cking},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Congestion Games: Optimization in Competition},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {9--20},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Vocking06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Wu06,
author = {Taoyang Wu},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Extremal Sequence Theory},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {159},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Wu06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/Zverovich06,
author = {Vadim E. Zverovich},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {The Computer System {GRAPHOGRAPH}},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {160},
publisher = {King's College, London},
year = {2006},
timestamp = {Mon, 25 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/Zverovich06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acid/2006,
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
publisher = {King's College, London},
year = {2006},
isbn = {1-904987-38-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-28 21:39 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
