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/alenex/alenex2012.bht:"
download as .bib file
@inproceedings{DBLP:conf/alenex/BlanchetteKV12,
author = {Mathieu Blanchette and
Ethan Kim and
Adrian Vetta},
editor = {David A. Bader and
Petra Mutzel},
title = {Clique Cover on Sparse Networks},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {93--102},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.10},
doi = {10.1137/1.9781611972924.10},
timestamp = {Tue, 29 Dec 2020 18:28:33 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BlanchetteKV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CanzarMRS12,
author = {Stefan Canzar and
Tobias Marschall and
Sven Rahmann and
Chris Schwiegelshohn},
editor = {David A. Bader and
Petra Mutzel},
title = {Solving the Minimum String Cover Problem},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {75--83},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.8},
doi = {10.1137/1.9781611972924.8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/CanzarMRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CornelsenKL12,
author = {Sabine Cornelsen and
Andreas Karrenbauer and
Shujun Li},
editor = {David A. Bader and
Petra Mutzel},
title = {Leveling the Grid},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {45--54},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.4},
doi = {10.1137/1.9781611972924.4},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/CornelsenKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DellingGRW12,
author = {Daniel Delling and
Andrew V. Goldberg and
Ilya P. Razenshteyn and
Renato Fonseca F. Werneck},
editor = {David A. Bader and
Petra Mutzel},
title = {Exact Combinatorial Branch-and-Bound for Graph Bisection},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {30--44},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.3},
doi = {10.1137/1.9781611972924.3},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/DellingGRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DellingKLW12,
author = {Daniel Delling and
Moritz Kobitzsch and
Dennis Luxen and
Renato Fonseca F. Werneck},
editor = {David A. Bader and
Petra Mutzel},
title = {Robust Mobile Route Planning with Limited Connectivity},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {150--159},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.15},
doi = {10.1137/1.9781611972924.15},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/DellingKLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DellingPW12,
author = {Daniel Delling and
Thomas Pajor and
Renato Fonseca F. Werneck},
editor = {David A. Bader and
Petra Mutzel},
title = {Round-Based Public Transit Routing},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {130--140},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.13},
doi = {10.1137/1.9781611972924.13},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/DellingPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DibbeltPW12,
author = {Julian Dibbelt and
Thomas Pajor and
Dorothea Wagner},
editor = {David A. Bader and
Petra Mutzel},
title = {User-Constrained Multi-Modal Route Planning},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {118--129},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.12},
doi = {10.1137/1.9781611972924.12},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/DibbeltPW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/EisnerF12,
author = {Jochen Eisner and
Stefan Funke},
editor = {David A. Bader and
Petra Mutzel},
title = {Transit Nodes - Lower Bounds and Refined Construction},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {141--149},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.14},
doi = {10.1137/1.9781611972924.14},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/EisnerF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GorkeSW12,
author = {Robert G{\"{o}}rke and
Andrea Schumm and
Dorothea Wagner},
editor = {David A. Bader and
Petra Mutzel},
title = {Experiments on Density-Constrained Graph Clustering},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {1--15},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.1},
doi = {10.1137/1.9781611972924.1},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/GorkeSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HohnJ12,
author = {Wiebke H{\"{o}}hn and
Tobias Jacobs},
editor = {David A. Bader and
Petra Mutzel},
title = {An Experimental and Analytical Study of Order Constraints for Single
Machine Scheduling with Quadratic Cost},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {103--117},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.11},
doi = {10.1137/1.9781611972924.11},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/HohnJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HuberMSSS12,
author = {Katharina T. Huber and
Vincent Moulton and
Andreas Spillner and
Sabine Storandt and
Radoslaw Suchecki},
editor = {David A. Bader and
Petra Mutzel},
title = {Computing a Consensus of Multilabeled Trees},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {84--92},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.9},
doi = {10.1137/1.9781611972924.9},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/HuberMSSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LangerRRS12,
author = {Alexander Langer and
Felix Reidl and
Peter Rossmanith and
Somnath Sikdar},
editor = {David A. Bader and
Petra Mutzel},
title = {Evaluation of an MSO-Solver},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {55--63},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.5},
doi = {10.1137/1.9781611972924.5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/LangerRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Munro12,
author = {J. Ian Munro},
editor = {David A. Bader and
Petra Mutzel},
title = {The Complexity of Partial Orders},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {64},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.6},
doi = {10.1137/1.9781611972924.6},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/Munro12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/OttavianoG12,
author = {Giuseppe Ottaviano and
Roberto Grossi},
editor = {David A. Bader and
Petra Mutzel},
title = {Fast Compressed Tries through Path Decompositions},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {65--74},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.7},
doi = {10.1137/1.9781611972924.7},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/OttavianoG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/SandersS12,
author = {Peter Sanders and
Christian Schulz},
editor = {David A. Bader and
Petra Mutzel},
title = {Distributed Evolutionary Graph Partitioning},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {16--29},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.2},
doi = {10.1137/1.9781611972924.2},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/SandersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/ThalerMS12,
author = {Justin Thaler and
Michael Mitzenmacher and
Thomas Steinke},
editor = {David A. Bader and
Petra Mutzel},
title = {Hierarchical Heavy Hitters with the Space Saving Algorithm},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {160--174},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.16},
doi = {10.1137/1.9781611972924.16},
timestamp = {Sun, 14 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/ThalerMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2012,
editor = {David A. Bader and
Petra Mutzel},
title = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924},
doi = {10.1137/1.9781611972924},
isbn = {978-1-61197-212-2},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/2012.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-20 16:50 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:
