Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Anusch Taraz
@article{DBLP:journals/cpc/AllenBEST22,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Julia Ehrenm{\"{u}}ller and
Jakob Schnitzer and
Anusch Taraz},
title = {A spanning bandwidth theorem in random graphs},
journal = {Comb. Probab. Comput.},
volume = {31},
number = {4},
pages = {598--628},
year = {2022},
url = {https://doi.org/10.1017/S0963548321000481},
doi = {10.1017/S0963548321000481},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/AllenBEST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ClemensMRST21,
author = {Dennis Clemens and
Meysam Miralaei and
Damian Reding and
Mathias Schacht and
Anusch Taraz},
title = {On the size-Ramsey number of grid graphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {5},
pages = {670--685},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000322},
doi = {10.1017/S0963548320000322},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/ClemensMRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HeinigMNT18,
author = {Peter Heinig and
Tobias M{\"{u}}ller and
Marc Noy and
Anusch Taraz},
title = {Logical limit laws for minor-closed classes of graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {130},
pages = {158--206},
year = {2018},
url = {https://doi.org/10.1016/j.jctb.2017.12.002},
doi = {10.1016/J.JCTB.2017.12.002},
timestamp = {Mon, 06 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/HeinigMNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FernandesST18,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {On minimum bisection and related cut problems in trees and tree-like
graphs},
journal = {J. Graph Theory},
volume = {89},
number = {2},
pages = {214--245},
year = {2018},
url = {https://doi.org/10.1002/jgt.22248},
doi = {10.1002/JGT.22248},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FernandesST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KohayakawaMST17,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht and
Anusch Taraz},
title = {Counting results for sparse pseudorandom hypergraphs {I}},
journal = {Eur. J. Comb.},
volume = {65},
pages = {276--287},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.04.008},
doi = {10.1016/J.EJC.2017.04.008},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KohayakawaMST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KohayakawaMST17a,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht and
Anusch Taraz},
title = {Counting results for sparse pseudorandom hypergraphs {II}},
journal = {Eur. J. Comb.},
volume = {65},
pages = {288--301},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.04.007},
doi = {10.1016/J.EJC.2017.04.007},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KohayakawaMST17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06411,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {On Minimum Bisection and Related Cut Problems in Trees and Tree-Like
Graphs},
journal = {CoRR},
volume = {abs/1708.06411},
year = {2017},
url = {http://arxiv.org/abs/1708.06411},
eprinttype = {arXiv},
eprint = {1708.06411},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06431,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {Approximating the Minimum k-Section Width in Bounded-Degree Trees
with Linear Diameter},
journal = {CoRR},
volume = {abs/1708.06431},
year = {2017},
url = {http://arxiv.org/abs/1708.06431},
eprinttype = {arXiv},
eprint = {1708.06431},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06431.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BottcherTW16,
author = {Julia B{\"{o}}ttcher and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {Spanning embeddings of arrangeable graphs with sublinear bandwidth},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {270--289},
year = {2016},
url = {https://doi.org/10.1002/rsa.20593},
doi = {10.1002/RSA.20593},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BottcherTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/MotaSST15,
author = {Guilherme Oliveira Mota and
G{\'{a}}bor N. S{\'{a}}rk{\"{o}}zy and
Mathias Schacht and
Anusch Taraz},
title = {Ramsey numbers for bipartite graphs with small bandwidth},
journal = {Eur. J. Comb.},
volume = {48},
pages = {165--176},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2015.02.018},
doi = {10.1016/J.EJC.2015.02.018},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/MotaSST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesST15,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {On Minimum Bisection and Related Partition Problems in Graphs with
Bounded Tree Width},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {481--488},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.067},
doi = {10.1016/J.ENDM.2015.06.067},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FernandesST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AllenBET15,
author = {Peter Allen and
Julia B{\"{o}}ttcher and
Julia Ehrenm{\"{u}}ller and
Anusch Taraz},
title = {Local resilience of spanning subgraphs in sparse random graphs},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {513--521},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.071},
doi = {10.1016/J.ENDM.2015.06.071},
timestamp = {Fri, 04 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AllenBET15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FernandesST15a,
author = {Cristina G. Fernandes and
Tina Janne Schmidt and
Anusch Taraz},
title = {Approximating Minimum k-Section in Trees with Linear Diameter},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {71--76},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.013},
doi = {10.1016/J.ENDM.2015.07.013},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FernandesST15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KohayakawaMST15,
author = {Yoshiharu Kohayakawa and
Guilherme Oliveira Mota and
Mathias Schacht and
Anusch Taraz},
title = {A counting lemma for sparse pseudorandom hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {421--426},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.070},
doi = {10.1016/J.ENDM.2015.07.070},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KohayakawaMST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BottcherKTW15,
author = {Julia B{\"{o}}ttcher and
Yoshiharu Kohayakawa and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {An Extension of the Blow-up Lemma to Arrangeable Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {2},
pages = {962--1001},
year = {2015},
url = {https://doi.org/10.1137/13093827X},
doi = {10.1137/13093827X},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BottcherKTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/HeisePPT14,
author = {Carl Georg Heise and
Konstantinos Panagiotou and
Oleg Pikhurko and
Anusch Taraz},
title = {Coloring d-Embeddable k-Uniform Hypergraphs},
journal = {Discret. Comput. Geom.},
volume = {52},
number = {4},
pages = {663--679},
year = {2014},
url = {https://doi.org/10.1007/s00454-014-9641-2},
doi = {10.1007/S00454-014-9641-2},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/HeisePPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BottcherHPT14,
author = {Julia B{\"{o}}ttcher and
Jan Hladk{\'{y}} and
Diana Piguet and
Anusch Taraz},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {An Approximate Version of the Tree Packing Conjecture via Random Embeddings},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {490--499},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.490},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.490},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BottcherHPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BottcherKT13,
author = {Julia B{\"{o}}ttcher and
Yoshiharu Kohayakawa and
Anusch Taraz},
title = {Almost Spanning Subgraphs of Random Graphs After Adversarial Edge
Removal},
journal = {Comb. Probab. Comput.},
volume = {22},
number = {5},
pages = {639--683},
year = {2013},
url = {https://doi.org/10.1017/S0963548313000199},
doi = {10.1017/S0963548313000199},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BottcherKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0029849,
author = {Anusch Taraz},
title = {Diskrete Mathematik - Grundlagen und Methoden},
series = {Mathematik Kompakt},
publisher = {Birkh{\"{a}}user},
year = {2012},
url = {https://doi.org/10.1007/978-3-7643-8901-7},
doi = {10.1007/978-3-7643-8901-7},
isbn = {978-3-7643-8898-0},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0029849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BottcherTW12,
author = {Julia B{\"{o}}ttcher and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {Perfect Graphs of Fixed Density: Counting and Homogeneous Sets},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {5},
pages = {661--682},
year = {2012},
url = {https://doi.org/10.1017/S0963548312000181},
doi = {10.1017/S0963548312000181},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BottcherTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherTW11,
author = {Julia B{\"{o}}ttcher and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {Induced C\({}_{\mbox{5}}\)-free graphs of fixed density: counting
and homogeneous sets},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {181--186},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.031},
doi = {10.1016/J.ENDM.2011.09.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherTW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BottcherPTW10,
author = {Julia B{\"{o}}ttcher and
Klaas Paul Pruessmann and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {Bandwidth, expansion, treewidth, separators and universality for bounded-degree
graphs},
journal = {Eur. J. Comb.},
volume = {31},
number = {5},
pages = {1217--1227},
year = {2010},
url = {https://doi.org/10.1016/j.ejc.2009.10.010},
doi = {10.1016/J.EJC.2009.10.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BottcherPTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BottcherHT10,
author = {Julia B{\"{o}}ttcher and
Peter Heinig and
Anusch Taraz},
title = {Embedding into Bipartite Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1215--1233},
year = {2010},
url = {https://doi.org/10.1137/090765481},
doi = {10.1137/090765481},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BottcherHT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherKT09,
author = {Julia B{\"{o}}ttcher and
Yoshiharu Kohayakawa and
Anusch Taraz},
title = {Almost spanning subgraphs of random graphs after adversarial edge
removal},
journal = {Electron. Notes Discret. Math.},
volume = {35},
pages = {335--340},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.11.055},
doi = {10.1016/J.ENDM.2009.11.055},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherKT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BehrischTU09,
author = {Michael Behrisch and
Anusch Taraz and
Michael Ueckerdt},
title = {Coloring Random Intersection Graphs and Complex Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {288--299},
year = {2009},
url = {https://doi.org/10.1137/050647153},
doi = {10.1137/050647153},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BehrischTU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherPTW08,
author = {Julia B{\"{o}}ttcher and
Klaas Paul Pruessmann and
Anusch Taraz and
Andreas W{\"{u}}rfl},
title = {Bandwidth, treewidth, separators, expansion, and universality},
journal = {Electron. Notes Discret. Math.},
volume = {31},
pages = {91--96},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.06.018},
doi = {10.1016/J.ENDM.2008.06.018},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherPTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BottcherST08,
author = {Julia B{\"{o}}ttcher and
Mathias Schacht and
Anusch Taraz},
title = {Spanning 3-colourable subgraphs of small bandwidth in dense graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {4},
pages = {752--777},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.11.005},
doi = {10.1016/J.JCTB.2007.11.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BottcherST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GerkeSST08,
author = {Stefanie Gerke and
Dirk Schlatter and
Angelika Steger and
Anusch Taraz},
title = {The random planar graph process},
journal = {Random Struct. Algorithms},
volume = {32},
number = {2},
pages = {236--261},
year = {2008},
url = {https://doi.org/10.1002/rsa.20186},
doi = {10.1002/RSA.20186},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GerkeSST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GerkePSST07,
author = {Stefanie Gerke and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Thomas Schickinger and
Angelika Steger and
Anusch Taraz},
title = {\emph{K} \({}_{\mbox{4}}\)-free subgraphs of random graphs revisited},
journal = {Comb.},
volume = {27},
number = {3},
pages = {329--365},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2010-5},
doi = {10.1007/S00493-007-2010-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GerkePSST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherST07,
author = {Julia B{\"{o}}ttcher and
Mathias Schacht and
Anusch Taraz},
title = {Embedding spanning subgraphs of small bandwidth},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {485--489},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.075},
doi = {10.1016/J.ENDM.2007.07.075},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BottcherST07,
author = {Julia B{\"{o}}ttcher and
Mathias Schacht and
Anusch Taraz},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {On the bandwidth conjecture for 3-colourable graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {618--626},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283450},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/BottcherST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BehrischT06,
author = {Michael Behrisch and
Anusch Taraz},
title = {Efficiently covering complex networks with cliques of similar vertices},
journal = {Theor. Comput. Sci.},
volume = {355},
number = {1},
pages = {37--47},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.12.005},
doi = {10.1016/J.TCS.2005.12.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BehrischT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/PikhurkoT05,
author = {Oleg Pikhurko and
Anusch Taraz},
title = {Degree Sequences of F-Free Graphs},
journal = {Electron. J. Comb.},
volume = {12},
year = {2005},
url = {https://doi.org/10.37236/1966},
doi = {10.37236/1966},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/PikhurkoT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SchachtT05,
author = {Mathias Schacht and
Anusch Taraz},
title = {Globally bounded local edge colourings of hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {179--185},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.025},
doi = {10.1016/J.ENDM.2005.05.025},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SchachtT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KuhnOT05,
author = {Daniela K{\"{u}}hn and
Deryk Osthus and
Anusch Taraz},
title = {Large planar subgraphs in dense graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {95},
number = {2},
pages = {263--282},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2005.04.004},
doi = {10.1016/J.JCTB.2005.04.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KuhnOT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Coja-OghlanT04,
author = {Amin Coja{-}Oghlan and
Anusch Taraz},
title = {Exact and approximative algorithms for coloring G(n, p)},
journal = {Random Struct. Algorithms},
volume = {24},
number = {3},
pages = {259--278},
year = {2004},
url = {https://doi.org/10.1002/rsa.20007},
doi = {10.1002/RSA.20007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Coja-OghlanT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/OsthusPT03,
author = {Deryk Osthus and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Anusch Taraz},
title = {For Which Densities are Random Triangle-Free Graphs Almost Surely
Bipartite?},
journal = {Comb.},
volume = {23},
number = {1},
pages = {105--150},
year = {2003},
url = {https://doi.org/10.1007/s00493-003-0016-1},
doi = {10.1007/S00493-003-0016-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/OsthusPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/OsthusPT03,
author = {Deryk Osthus and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Anusch Taraz},
title = {On random planar graphs, the number of planar graphs and their triangulations},
journal = {J. Comb. Theory, Ser. {B}},
volume = {88},
number = {1},
pages = {119--134},
year = {2003},
url = {https://doi.org/10.1016/S0095-8956(02)00040-0},
doi = {10.1016/S0095-8956(02)00040-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/OsthusPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Coja-OghlanT03,
author = {Amin Coja{-}Oghlan and
Anusch Taraz},
editor = {Helmut Alt and
Michel Habib},
title = {Colouring Random Graphs in Expected Polynomial Time},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {487--498},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_43},
doi = {10.1007/3-540-36494-3\_43},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Coja-OghlanT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/PromelST01,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger and
Anusch Taraz},
title = {Counting Partial Orders With {A} Fixed Number Of Comparable Pairs},
journal = {Comb. Probab. Comput.},
volume = {10},
number = {2},
pages = {159--177},
year = {2001},
url = {https://doi.org/10.1017/S0963548301004503},
doi = {10.1017/S0963548301004503},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/PromelST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PromelST01,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger and
Anusch Taraz},
title = {Asymptotic enumeration, global structure, and constrained evolution},
journal = {Discret. Math.},
volume = {229},
number = {1-3},
pages = {213--233},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00211-9},
doi = {10.1016/S0012-365X(00)00211-9},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/PromelST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PromelST01,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger and
Anusch Taraz},
title = {Phase Transitions in the Evolution of Partial Orders},
journal = {J. Comb. Theory, Ser. {A}},
volume = {94},
number = {2},
pages = {230--275},
year = {2001},
url = {https://doi.org/10.1006/jcta.2000.3135},
doi = {10.1006/JCTA.2000.3135},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PromelST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/OsthusPT01,
author = {Deryk Osthus and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Anusch Taraz},
title = {Almost all graphs with high girth and suitable density have high chromatic
number},
journal = {J. Graph Theory},
volume = {37},
number = {4},
pages = {220--226},
year = {2001},
url = {https://doi.org/10.1002/jgt.1017},
doi = {10.1002/JGT.1017},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/OsthusPT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/OsthusT01,
author = {Deryk Osthus and
Anusch Taraz},
title = {Random maximal H-free graphs},
journal = {Random Struct. Algorithms},
volume = {18},
number = {1},
pages = {61--82},
year = {2001},
url = {https://doi.org/10.1002/1098-2418(200101)18:1\&\#60;61::AID-RSA5\&\#62;3.0.CO;2-T},
doi = {10.1002/1098-2418(200101)18:1\&\#60;61::AID-RSA5\&\#62;3.0.CO;2-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/OsthusT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ac/PromelT01,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
Anusch Taraz},
editor = {Helmut Alt},
title = {Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders},
booktitle = {Computational Discrete Mathematics, Advanced Lectures},
series = {Lecture Notes in Computer Science},
volume = {2122},
pages = {98--118},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45506-X\_8},
doi = {10.1007/3-540-45506-X\_8},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/ac/PromelT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Taraz99,
author = {Anusch Taraz},
title = {Phase transitions in the evolution of partially ordered sets},
school = {{HU} Berlin, Germany},
year = {1999},
url = {http://edoc.hu-berlin.de/18452/15007},
urn = {urn:nbn:de:kobv:11-1008949},
doi = {10.18452/14355},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/basesearch/Taraz99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RodlRT99,
author = {Vojtech R{\"{o}}dl and
Andrzej Rucinski and
Anusch Taraz},
title = {Hypergraph Packing And Graph Embedding},
journal = {Comb. Probab. Comput.},
volume = {8},
number = {4},
pages = {363--376},
year = {1999},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46713},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RodlRT99.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.
last updated on 2024-04-14 01:13 CEST 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:
