Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Farhad Shahrokhi
@article{DBLP:journals/algorithms/LiPS20,
author = {Jonathan Li and
Rohan Potru and
Farhad Shahrokhi},
title = {A Performance Study of Some Approximation Algorithms for Computing
a Small Dominating Set in a Graph},
journal = {Algorithms},
volume = {13},
number = {12},
pages = {339},
year = {2020},
url = {https://doi.org/10.3390/a13120339},
doi = {10.3390/A13120339},
timestamp = {Thu, 25 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/LiPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-13016,
author = {Farhad Shahrokhi},
title = {Bounding the trace function of a hypergraph with applications},
journal = {CoRR},
volume = {abs/2007.13016},
year = {2020},
url = {https://arxiv.org/abs/2007.13016},
eprinttype = {arXiv},
eprint = {2007.13016},
timestamp = {Wed, 29 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-13016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-04636,
author = {Jonathan S. Li and
Rohan Potru and
Farhad Shahrokhi},
title = {A performance study of some approximation algorithms for minimum dominating
set in a graph},
journal = {CoRR},
volume = {abs/2009.04636},
year = {2020},
url = {https://arxiv.org/abs/2009.04636},
eprinttype = {arXiv},
eprint = {2009.04636},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-04636.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-01378,
author = {Farhad Shahrokhi},
title = {Strong Pseudo Transitivity and Intersection Graphs},
journal = {CoRR},
volume = {abs/1806.01378},
year = {2018},
url = {http://arxiv.org/abs/1806.01378},
eprinttype = {arXiv},
eprint = {1806.01378},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-01378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi17,
author = {Farhad Shahrokhi},
title = {Algorithms For Longest Chains In Pseudo- Transitive Graphs},
journal = {CoRR},
volume = {abs/1701.05286},
year = {2017},
url = {http://arxiv.org/abs/1701.05286},
eprinttype = {arXiv},
eprint = {1701.05286},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi17a,
author = {Farhad Shahrokhi},
title = {Unit Incomparability Dimension and Clique Cover Width in Graphs},
journal = {CoRR},
volume = {abs/1705.04395},
year = {2017},
url = {http://arxiv.org/abs/1705.04395},
eprinttype = {arXiv},
eprint = {1705.04395},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi15c,
author = {Farhad Shahrokhi},
title = {A new upper bound for the clique cover number with applications},
journal = {CoRR},
volume = {abs/1502.06168},
year = {2015},
url = {http://arxiv.org/abs/1502.06168},
eprinttype = {arXiv},
eprint = {1502.06168},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi15c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi15d,
author = {Farhad Shahrokhi},
title = {New representation results for planar graphs},
journal = {CoRR},
volume = {abs/1502.06175},
year = {2015},
url = {http://arxiv.org/abs/1502.06175},
eprinttype = {arXiv},
eprint = {1502.06175},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi15d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi15,
author = {Farhad Shahrokhi},
title = {New separation theorems and sub-exponential time algorithms for packing
and piercing of fat objects},
journal = {CoRR},
volume = {abs/1502.06176},
year = {2015},
url = {http://arxiv.org/abs/1502.06176},
eprinttype = {arXiv},
eprint = {1502.06176},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi15a,
author = {Farhad Shahrokhi},
title = {A new separation theorem with geometric applications},
journal = {CoRR},
volume = {abs/1504.04938},
year = {2015},
url = {http://arxiv.org/abs/1504.04938},
eprinttype = {arXiv},
eprint = {1504.04938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Shahrokhi15b,
author = {Farhad Shahrokhi},
title = {Bounds for the Clique Cover Width of Factors of the Apex Graph of
the Planar Grid},
journal = {CoRR},
volume = {abs/1506.06813},
year = {2015},
url = {http://arxiv.org/abs/1506.06813},
eprinttype = {arXiv},
eprint = {1506.06813},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Shahrokhi15b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Shahrokhi11,
author = {Farhad Shahrokhi},
title = {Guest Editor's Foreword: Algorithms, Combinatorics, {\&} Geometry},
journal = {Algorithmica},
volume = {60},
number = {3},
pages = {481--483},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9493-6},
doi = {10.1007/S00453-011-9493-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Shahrokhi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PachS07,
author = {J{\'{a}}nos Pach and
Farhad Shahrokhi},
title = {Guest Editors' Foreword},
journal = {Algorithmica},
volume = {47},
number = {4},
pages = {365},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-0147-z},
doi = {10.1007/S00453-006-0147-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PachS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShahrokhiSSV07,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
title = {On k-planar crossing numbers},
journal = {Discret. Appl. Math.},
volume = {155},
number = {9},
pages = {1106--1115},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2005.12.011},
doi = {10.1016/J.DAM.2005.12.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShahrokhiSSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ShahrokhiSSV03,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Tandy J. Warnow and
Binhai Zhu},
title = {Bounds for Convex Crossing Numbers},
booktitle = {Computing and Combinatorics, 9th Annual International Conference,
{COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2697},
pages = {487--495},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45071-8\_49},
doi = {10.1007/3-540-45071-8\_49},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ShahrokhiSSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ShahrokhiSSV03,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Giuseppe Liotta},
title = {Bounds and Methods for k-Planar Crossing Numbers},
booktitle = {Graph Drawing, 11th International Symposium, {GD} 2003, Perugia, Italy,
September 21-24, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2912},
pages = {37--46},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24595-7\_4},
doi = {10.1007/978-3-540-24595-7\_4},
timestamp = {Sun, 13 Nov 2022 09:57:34 +0100},
biburl = {https://dblp.org/rec/conf/gd/ShahrokhiSSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ShahrokhiS02,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
title = {Guest Editors' Foreword},
journal = {Discret. Comput. Geom.},
volume = {28},
number = {4},
pages = {447--448},
year = {2002},
url = {https://doi.org/10.1007/s00454-002-2899-9},
doi = {10.1007/S00454-002-2899-9},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ShahrokhiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShahrokhiS01,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
title = {Constructing integral uniform flows in symmetric networks with application
to the edge-forwarding index problem},
journal = {Discret. Appl. Math.},
volume = {108},
number = {1-2},
pages = {175--191},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00228-6},
doi = {10.1016/S0166-218X(00)00228-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ShahrokhiS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ShahrokhiS00,
author = {Farhad Shahrokhi and
Weiping Shi},
title = {On Crossing Sets, Disjoint Sets, and Pagenumber},
journal = {J. Algorithms},
volume = {34},
number = {1},
pages = {40--53},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1049},
doi = {10.1006/JAGM.1999.1049},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ShahrokhiS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShahrokhiSSV00,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
title = {On Bipartite Drawings and the Linear Arrangement Problem},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1773--1789},
year = {2000},
url = {https://doi.org/10.1137/S0097539797331671},
doi = {10.1137/S0097539797331671},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShahrokhiSSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShahrokhiSSV00,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
title = {A new lower bound for the bipartite crossing number with applications},
journal = {Theor. Comput. Sci.},
volume = {245},
number = {2},
pages = {281--294},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00285-6},
doi = {10.1016/S0304-3975(99)00285-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShahrokhiSSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ShahrokhiV99,
author = {Farhad Shahrokhi and
Imrich Vrto},
editor = {Jan Kratochv{\'{\i}}l},
title = {On 3-Layer Crossings and Pseudo Arrangements},
booktitle = {Graph Drawing, 7th International Symposium, GD'99, Stir{\'{\i}}n
Castle, Czech Republic, September 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1731},
pages = {225--231},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46648-7\_23},
doi = {10.1007/3-540-46648-7\_23},
timestamp = {Sun, 13 Nov 2022 09:57:36 +0100},
biburl = {https://dblp.org/rec/conf/gd/ShahrokhiV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ShahrokhiSSV98,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
title = {Intersection of Curves and Crossing Number of C\({}_{\mbox{m}}\) x
C\({}_{\mbox{n}}\) on Surfaces},
journal = {Discret. Comput. Geom.},
volume = {19},
number = {2},
pages = {237--247},
year = {1998},
url = {https://doi.org/10.1007/PL00009343},
doi = {10.1007/PL00009343},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ShahrokhiSSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ShahrokhiS98,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Integral Uniform Flows in Symmetric Networks},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {272--284},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_22},
doi = {10.1007/10692760\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ShahrokhiS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ShahrokhiSSV97,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Giuseppe Di Battista},
title = {Bipartite Crossing Numbers of Meshes and Hypercubes},
booktitle = {Graph Drawing, 5th International Symposium, {GD} '97, Rome, Italy,
September 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1353},
pages = {37--46},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63938-1\_48},
doi = {10.1007/3-540-63938-1\_48},
timestamp = {Sun, 13 Nov 2022 09:57:37 +0100},
biburl = {https://dblp.org/rec/conf/gd/ShahrokhiSSV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ShahrokhiSSV97,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear
Arrangement Problem},
booktitle = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
pages = {55--68},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_48},
doi = {10.1007/3-540-63307-3\_48},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/ShahrokhiSSV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PachSS96,
author = {J{\'{a}}nos Pach and
Farhad Shahrokhi and
Mario Szegedy},
title = {Applications of the Crossing Number},
journal = {Algorithmica},
volume = {16},
number = {1},
pages = {111--117},
year = {1996},
url = {https://doi.org/10.1007/BF02086610},
doi = {10.1007/BF02086610},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PachSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShahrokhiSSV96,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Ondrej S{\'{y}}kora and
Imrich Vrto},
title = {Drawings of Graphs on Surfaces with Few Crossings},
journal = {Algorithmica},
volume = {16},
number = {1},
pages = {118--131},
year = {1996},
url = {https://doi.org/10.1007/BF02086611},
doi = {10.1007/BF02086611},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ShahrokhiSSV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ShahrokhiSSV96,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Ondrej S{\'{y}}kora and
Imrich Vrt'o},
title = {The book crossing number of a graph},
journal = {J. Graph Theory},
volume = {21},
number = {4},
pages = {413--424},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199604)21:4\&\#60;413::AID-JGT7\&\#62;3.0.CO;2-S},
doi = {10.1002/(SICI)1097-0118(199604)21:4\&\#60;413::AID-JGT7\&\#62;3.0.CO;2-S},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ShahrokhiSSV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ShahrokhiS96,
author = {Farhad Shahrokhi and
Weiping Shi},
editor = {Jin{-}yi Cai and
C. K. Wong},
title = {Efficient Deterministic Algorithms for Embedding Graphs on Books},
booktitle = {Computing and Combinatorics, Second Annual International Conference,
{COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1090},
pages = {162--168},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61332-3\_149},
doi = {10.1007/3-540-61332-3\_149},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ShahrokhiS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ShahrokhiSSV95,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Franz{-}Josef Brandenburg},
title = {Crossing Numbers of Meshes},
booktitle = {Graph Drawing, Symposium on Graph Drawing, {GD} '95, Passau, Germany,
September 20-22, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1027},
pages = {463--471},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0021830},
doi = {10.1007/BFB0021830},
timestamp = {Sun, 13 Nov 2022 09:57:38 +0100},
biburl = {https://dblp.org/rec/conf/gd/ShahrokhiSSV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ShahrokhiS94,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
title = {On Canonical Concurrent Flows, Crossing Number and Graph Expansion},
journal = {Comb. Probab. Comput.},
volume = {3},
pages = {523--543},
year = {1994},
url = {https://doi.org/10.1017/S0963548300001383},
doi = {10.1017/S0963548300001383},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ShahrokhiS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/PachSS94,
author = {J{\'{a}}nos Pach and
Farhad Shahrokhi and
Mario Szegedy},
editor = {Kurt Mehlhorn},
title = {Applications of the Crossing Number},
booktitle = {Proceedings of the Tenth Annual Symposium on Computational Geometry,
Stony Brook, New York, USA, June 6-8, 1994},
pages = {198--202},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/177424.177629},
doi = {10.1145/177424.177629},
timestamp = {Mon, 14 Jun 2021 16:25:06 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/PachSS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/ShahrokhiSV94,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Roberto Tamassia and
Ioannis G. Tollis},
title = {Crossing Numbers of Graphs, Lower Bound Techniques},
booktitle = {Graph Drawing, {DIMACS} International Workshop, {GD} '94, Princeton,
New Jersey, USA, October 10-12, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {894},
pages = {131--142},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58950-3\_364},
doi = {10.1007/3-540-58950-3\_364},
timestamp = {Sun, 13 Nov 2022 09:57:39 +0100},
biburl = {https://dblp.org/rec/conf/gd/ShahrokhiSV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ShahrokhiSSV94,
author = {Farhad Shahrokhi and
Ondrej S{\'{y}}kora and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Imrich Vrto},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Book Embeddings and Crossing Numbers},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {256--268},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_53},
doi = {10.1007/3-540-59071-4\_53},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/ShahrokhiSSV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ShahrokhiS93,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
editor = {Jan van Leeuwen},
title = {Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary
Version)},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {327--337},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_63},
doi = {10.1007/3-540-57899-4\_63},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ShahrokhiS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ShahrokhiSSV93,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Ondrej S{\'{y}}kora and
Imrich Vrto},
editor = {Jan van Leeuwen},
title = {Improving Bounds for the Crossing Numbers on Surfaces of Genus g},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {388--395},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_68},
doi = {10.1007/3-540-57899-4\_68},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ShahrokhiSSV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClarkSS92,
author = {Lane H. Clark and
Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
title = {A Linear Time Algorithm for Graph Partition Problems},
journal = {Inf. Process. Lett.},
volume = {42},
number = {1},
pages = {19--24},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90126-G},
doi = {10.1016/0020-0190(92)90126-G},
timestamp = {Thu, 31 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClarkSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ShahrokhiS92,
author = {Farhad Shahrokhi and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {Effective Lower Bounds for Crossing Number, Bisection Width and Balanced
Vertex Separator in Terms of Symmetry},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {102--113},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ShahrokhiS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MatulaS90,
author = {David W. Matula and
Farhad Shahrokhi},
title = {Sparsest cuts and bottlenecks in graphs},
journal = {Discret. Appl. Math.},
volume = {27},
number = {1-2},
pages = {113--123},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90133-W},
doi = {10.1016/0166-218X(90)90133-W},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MatulaS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ShahrokhiM90,
author = {Farhad Shahrokhi and
David W. Matula},
title = {The Maximum Concurrent Flow Problem},
journal = {J. {ACM}},
volume = {37},
number = {2},
pages = {318--334},
year = {1990},
url = {https://doi.org/10.1145/77600.77620},
doi = {10.1145/77600.77620},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ShahrokhiM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Shahrokhi89,
author = {Farhad Shahrokhi},
title = {Approximation Algorithms for the Maximum Concurrent Flow Problem},
journal = {{INFORMS} J. Comput.},
volume = {1},
number = {2},
pages = {62--69},
year = {1989},
url = {https://doi.org/10.1287/ijoc.1.2.62},
doi = {10.1287/IJOC.1.2.62},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Shahrokhi89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LindhorstS89,
author = {G. Lindhorst and
Farhad Shahrokhi},
title = {On Renaming a Set of Clauses as a Horn Set},
journal = {Inf. Process. Lett.},
volume = {30},
number = {6},
pages = {289--293},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90229-9},
doi = {10.1016/0020-0190(89)90229-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LindhorstS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acm/ShahrokhiM87,
author = {Farhad Shahrokhi and
David W. Matula},
editor = {Pat Davis and
Vicki McClintock},
title = {On solving large maximum concurrent flow problems},
booktitle = {Proceedings of the 15th {ACM} Annual Conference on Computer Science,
St. Louis, Missouri, USA, February 16-19, 1987},
pages = {205--209},
publisher = {{ACM}},
year = {1987},
url = {https://doi.org/10.1145/322917.322949},
doi = {10.1145/322917.322949},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/acm/ShahrokhiM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acm/Shahrokhi86,
author = {Farhad Shahrokhi},
editor = {Lawrence A. Jehn and
Larry A. Crum},
title = {An efficient flow routing algorithm to solve the maximum concurrent
flow problem with applications to the packed switched telecommunication
networks and cluster analysis (abstract)},
booktitle = {Proceedings of the 14th {ACM} Annual Conference on Computer Science,
Cincinnati, Ohio, USA, 1986},
pages = {494},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/324634.325329},
doi = {10.1145/324634.325329},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/acm/Shahrokhi86.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-25 05:47 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:
