BibTeX records: Tibor Jordán

download as .bib file

@article{DBLP:journals/dm/JordanHSWZ24,
  author       = {Tibor Jord{\'{a}}n and
                  Robin Huang and
                  Henry Simmons and
                  Kaylee Weatherspoon and
                  Zeyu Zheng},
  title        = {Four-regular graphs with extremal rigidity properties},
  journal      = {Discret. Math.},
  volume       = {347},
  number       = {4},
  pages        = {113833},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.disc.2023.113833},
  doi          = {10.1016/J.DISC.2023.113833},
  timestamp    = {Fri, 08 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/JordanHSWZ24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jordan24,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Ear-decompositions, minimally connected matroids and rigid graphs},
  journal      = {J. Graph Theory},
  volume       = {105},
  number       = {3},
  pages        = {451--467},
  year         = {2024},
  url          = {https://doi.org/10.1002/jgt.23046},
  doi          = {10.1002/JGT.23046},
  timestamp    = {Wed, 20 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgt/Jordan24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jordan23,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Rigid block and hole graphs with a single block},
  journal      = {Discret. Math.},
  volume       = {346},
  number       = {3},
  pages        = {113268},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.disc.2022.113268},
  doi          = {10.1016/J.DISC.2022.113268},
  timestamp    = {Tue, 28 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Jordan23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GaramvolgyiJ23,
  author       = {D{\'{a}}niel Garamv{\"{o}}lgyi and
                  Tibor Jord{\'{a}}n},
  title        = {Minimally globally rigid graphs},
  journal      = {Eur. J. Comb.},
  volume       = {108},
  pages        = {103626},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.ejc.2022.103626},
  doi          = {10.1016/J.EJC.2022.103626},
  timestamp    = {Sun, 12 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/GaramvolgyiJ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JordanPR22,
  author       = {Tibor Jord{\'{a}}n and
                  Christopher Poston and
                  Ryan Roach},
  title        = {Extremal families of redundantly rigid graphs in three dimensions},
  journal      = {Discret. Appl. Math.},
  volume       = {322},
  pages        = {448--464},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.dam.2022.03.006},
  doi          = {10.1016/J.DAM.2022.03.006},
  timestamp    = {Sun, 13 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JordanPR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/JordanT22,
  author       = {Tibor Jord{\'{a}}n and
                  Shin{-}ichi Tanigawa},
  title        = {Globally rigid powers of graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {155},
  pages        = {111--140},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.jctb.2022.02.004},
  doi          = {10.1016/J.JCTB.2022.02.004},
  timestamp    = {Thu, 05 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jctb/JordanT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JordanT22,
  author       = {Tibor Jord{\'{a}}n and
                  Shin{-}ichi Tanigawa},
  title        = {Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {36},
  number       = {3},
  pages        = {2367--2392},
  year         = {2022},
  url          = {https://doi.org/10.1137/20m1349849},
  doi          = {10.1137/20M1349849},
  timestamp    = {Tue, 07 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/JordanT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GaramvolgyiJ22,
  author       = {D{\'{a}}niel Garamv{\"{o}}lgyi and
                  Tibor Jord{\'{a}}n},
  editor       = {Yeganeh Bahoo and
                  Konstantinos Georgiou},
  title        = {Globally linked pairs in braced maximal outerplanar graphs},
  booktitle    = {Proceedings of the 34th Canadian Conference on Computational Geometry,
                  {CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
                  August 25-27, 2022},
  pages        = {162--168},
  year         = {2022},
  timestamp    = {Wed, 23 Nov 2022 15:41:57 +0100},
  biburl       = {https://dblp.org/rec/conf/cccg/GaramvolgyiJ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Jordan21,
  author       = {Tibor Jord{\'{a}}n},
  title        = {A note on generic rigidity of graphs in higher dimension},
  journal      = {Discret. Appl. Math.},
  volume       = {297},
  pages        = {97--101},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.dam.2021.03.003},
  doi          = {10.1016/J.DAM.2021.03.003},
  timestamp    = {Fri, 21 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/Jordan21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/GaramvolgyiJ21,
  author       = {D{\'{a}}niel Garamv{\"{o}}lgyi and
                  Tibor Jord{\'{a}}n},
  title        = {Graph Reconstruction from Unlabeled Edge Lengths},
  journal      = {Discret. Comput. Geom.},
  volume       = {66},
  number       = {1},
  pages        = {344--385},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00454-021-00275-7},
  doi          = {10.1007/S00454-021-00275-7},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/GaramvolgyiJ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Jordan21,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Minimum Size Highly Redundantly Rigid Graphs in the Plane},
  journal      = {Graphs Comb.},
  volume       = {37},
  number       = {4},
  pages        = {1415--1431},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00373-021-02327-4},
  doi          = {10.1007/S00373-021-02327-4},
  timestamp    = {Thu, 05 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/gc/Jordan21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GaramvolgyiJ20,
  author       = {D{\'{a}}niel Garamv{\"{o}}lgyi and
                  Tibor Jord{\'{a}}n},
  title        = {Global Rigidity of Unit Ball Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {34},
  number       = {1},
  pages        = {212--229},
  year         = {2020},
  url          = {https://doi.org/10.1137/18M1220662},
  doi          = {10.1137/18M1220662},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamdm/GaramvolgyiJ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/JordanKMM20,
  author       = {Tibor Jord{\'{a}}n and
                  Yusuke Kobayashi and
                  Ryoga Mahara and
                  Kazuhisa Makino},
  editor       = {Leszek Gasieniec and
                  Ralf Klasing and
                  Tomasz Radzik},
  title        = {The Steiner Problem for Count Matroids},
  booktitle    = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
                  Bordeaux, France, June 8-10, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12126},
  pages        = {330--342},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-48966-3\_25},
  doi          = {10.1007/978-3-030-48966-3\_25},
  timestamp    = {Fri, 04 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/JordanKMM20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/BertokCJ19,
  author       = {Botond Bert{\'{o}}k and
                  Tibor Csendes and
                  Tibor Jord{\'{a}}n},
  title        = {Editorial},
  journal      = {Central Eur. J. Oper. Res.},
  volume       = {27},
  number       = {2},
  pages        = {325--327},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10100-018-0603-2},
  doi          = {10.1007/S10100-018-0603-2},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cejor/BertokCJ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JordanT19,
  author       = {Tibor Jord{\'{a}}n and
                  Shin{-}ichi Tanigawa},
  title        = {Global rigidity of triangulations with braces},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {136},
  pages        = {249--288},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.jctb.2018.11.003},
  doi          = {10.1016/J.JCTB.2018.11.003},
  timestamp    = {Mon, 15 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/JordanT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JordanKM18,
  author       = {Tibor Jord{\'{a}}n and
                  Tam{\'{a}}s Kis and
                  Silvano Martello},
  title        = {Computational advances in combinatorial optimization},
  journal      = {Discret. Appl. Math.},
  volume       = {242},
  pages        = {1--3},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.dam.2018.02.002},
  doi          = {10.1016/J.DAM.2018.02.002},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JordanKM18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/JordanKT16,
  author       = {Tibor Jord{\'{a}}n and
                  Vikt{\'{o}}ria E. Kaszanitzky and
                  Shin{-}ichi Tanigawa},
  title        = {Gain-Sparsity and Symmetry-Forced Rigidity in the Plane},
  journal      = {Discret. Comput. Geom.},
  volume       = {55},
  number       = {2},
  pages        = {314--372},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00454-015-9755-1},
  doi          = {10.1007/S00454-015-9755-1},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/JordanKT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JordanKT16,
  author       = {Tibor Jord{\'{a}}n and
                  Csaba Kir{\'{a}}ly and
                  Shin{-}ichi Tanigawa},
  title        = {Generic global rigidity of body-hinge frameworks},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {117},
  pages        = {59--76},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jctb.2015.11.003},
  doi          = {10.1016/J.JCTB.2015.11.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JordanKT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonJT16,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n and
                  Shin{-}ichi Tanigawa},
  title        = {Unique low rank completability of partially filled matrices},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {121},
  pages        = {432--462},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jctb.2016.07.013},
  doi          = {10.1016/J.JCTB.2016.07.013},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JacksonJT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/JordanN15,
  author       = {Tibor Jord{\'{a}}n and
                  Viet Hang Nguyen},
  title        = {On universally rigid frameworks on the line},
  journal      = {Contributions Discret. Math.},
  volume       = {10},
  number       = {2},
  year         = {2015},
  url          = {http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/378},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cdm/JordanN15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JordanK15,
  author       = {Tibor Jord{\'{a}}n and
                  Vikt{\'{o}}ria E. Kaszanitzky},
  title        = {Sparse hypergraphs with applications in combinatorial rigidity},
  journal      = {Discret. Appl. Math.},
  volume       = {185},
  pages        = {93--101},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.dam.2014.12.020},
  doi          = {10.1016/J.DAM.2014.12.020},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JordanK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FeketeJK15,
  author       = {Zsolt Fekete and
                  Tibor Jord{\'{a}}n and
                  Vikt{\'{o}}ria E. Kaszanitzky},
  title        = {Rigid Two-Dimensional Frameworks with Two Coincident Points},
  journal      = {Graphs Comb.},
  volume       = {31},
  number       = {3},
  pages        = {585--599},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00373-013-1390-0},
  doi          = {10.1007/S00373-013-1390-0},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/FeketeJK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JordanS15,
  author       = {Tibor Jord{\'{a}}n and
                  Ildik{\'{o}} Schlotter},
  title        = {Parameterized complexity of spare capacity allocation and the multicost
                  Steiner subgraph problem},
  journal      = {J. Discrete Algorithms},
  volume       = {30},
  pages        = {29--44},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2014.11.005},
  doi          = {10.1016/J.JDA.2014.11.005},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/JordanS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/IwataJ14,
  author       = {Satoru Iwata and
                  Tibor Jord{\'{a}}n},
  title        = {Orientations and detachments of graphs with prescribed degrees and
                  connectivity},
  journal      = {Discret. Optim.},
  volume       = {12},
  pages        = {121--128},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.disopt.2014.02.003},
  doi          = {10.1016/J.DISOPT.2014.02.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/IwataJ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JacksonJT14,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n and
                  Shin{-}ichi Tanigawa},
  title        = {Combinatorial Conditions for the Unique Completability of Low-Rank
                  Matrices},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {28},
  number       = {4},
  pages        = {1797--1819},
  year         = {2014},
  url          = {https://doi.org/10.1137/140960098},
  doi          = {10.1137/140960098},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/JacksonJT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cejor/CsendesJS13,
  author       = {Tibor Csendes and
                  Tibor Jord{\'{a}}n and
                  Tam{\'{a}}s Sz{\'{a}}ntai},
  title        = {Editorial},
  journal      = {Central Eur. J. Oper. Res.},
  volume       = {21},
  number       = {4},
  pages        = {663--664},
  year         = {2013},
  url          = {https://doi.org/10.1007/s10100-012-0280-5},
  doi          = {10.1007/S10100-012-0280-5},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cejor/CsendesJS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JacksonJK13,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n and
                  Csaba Kir{\'{a}}ly},
  title        = {Strongly rigid tensegrity graphs on the line},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {7-8},
  pages        = {1147--1149},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2012.12.009},
  doi          = {10.1016/J.DAM.2012.12.009},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JacksonJK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/GelejiJ13,
  author       = {J{\'{a}}nos Geleji and
                  Tibor Jord{\'{a}}n},
  title        = {Robust Tensegrity Polygons},
  journal      = {Discret. Comput. Geom.},
  volume       = {50},
  number       = {3},
  pages        = {537--551},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00454-013-9539-4},
  doi          = {10.1007/S00454-013-9539-4},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/GelejiJ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JordanK13,
  author       = {Tibor Jord{\'{a}}n and
                  Vikt{\'{o}}ria E. Kaszanitzky},
  title        = {Highly connected rigidity matroids have unique underlying graphs},
  journal      = {Eur. J. Comb.},
  volume       = {34},
  number       = {2},
  pages        = {240--247},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ejc.2012.09.001},
  doi          = {10.1016/J.EJC.2012.09.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/JordanK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ConnellyJW13,
  author       = {Robert Connelly and
                  Tibor Jord{\'{a}}n and
                  Walter Whiteley},
  title        = {Generic global rigidity of body-bar frameworks},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {103},
  number       = {6},
  pages        = {689--705},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.jctb.2013.09.002},
  doi          = {10.1016/J.JCTB.2013.09.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/ConnellyJW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JordanDT13,
  author       = {Tibor Jord{\'{a}}n and
                  G{\'{a}}bor Domokos and
                  Krisztina T{\'{o}}th},
  title        = {Geometric Sensitivity of Rigid Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {27},
  number       = {4},
  pages        = {1710--1726},
  year         = {2013},
  url          = {https://doi.org/10.1137/110860872},
  doi          = {10.1137/110860872},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/JordanDT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jordan12,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Highly connected molecular graphs are rigid in three dimensions},
  journal      = {Inf. Process. Lett.},
  volume       = {112},
  number       = {8-9},
  pages        = {356--359},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ipl.2012.01.013},
  doi          = {10.1016/J.IPL.2012.01.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Jordan12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JacksonJ10,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Brick partitions of graphs},
  journal      = {Discret. Math.},
  volume       = {310},
  number       = {2},
  pages        = {270--275},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disc.2008.09.034},
  doi          = {10.1016/J.DISC.2008.09.034},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/JacksonJ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Bang-JensenJ10,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Spanning 2-strong tournaments in 3-strong semicomplete digraphs},
  journal      = {Discret. Math.},
  volume       = {310},
  number       = {9},
  pages        = {1424--1428},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disc.2009.04.019},
  doi          = {10.1016/J.DISC.2009.04.019},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Bang-JensenJ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JacksonJ10,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {The generic rank of body-bar-and-hinge frameworks},
  journal      = {Eur. J. Comb.},
  volume       = {31},
  number       = {2},
  pages        = {574--588},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ejc.2009.03.030},
  doi          = {10.1016/J.EJC.2009.03.030},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/JacksonJ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/JacksonJ10,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Operations Preserving Global Rigidity of Generic Direction-Length
                  Frameworks},
  journal      = {Int. J. Comput. Geom. Appl.},
  volume       = {20},
  number       = {6},
  pages        = {685--706},
  year         = {2010},
  url          = {https://doi.org/10.1142/S0218195910003487},
  doi          = {10.1142/S0218195910003487},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcga/JacksonJ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jordan10,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Generically globally rigid zeolites in the plane},
  journal      = {Inf. Process. Lett.},
  volume       = {110},
  number       = {18-19},
  pages        = {841--844},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.ipl.2010.06.011},
  doi          = {10.1016/J.IPL.2010.06.011},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Jordan10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonJ10,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Globally rigid circuits of the direction-length rigidity matroid},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {100},
  number       = {1},
  pages        = {1--22},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.jctb.2009.03.004},
  doi          = {10.1016/J.JCTB.2009.03.004},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JacksonJ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/JordanS09,
  author       = {Tibor Jord{\'{a}}n and
                  Zoltan Szabadka},
  title        = {Operations preserving the global rigidity of graphs and frameworks
                  in the plane},
  journal      = {Comput. Geom.},
  volume       = {42},
  number       = {6-7},
  pages        = {511--521},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.comgeo.2008.09.007},
  doi          = {10.1016/J.COMGEO.2008.09.007},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/JordanS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JacksonJ09,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {A sufficient connectivity condition for generic rigidity in the plane},
  journal      = {Discret. Appl. Math.},
  volume       = {157},
  number       = {8},
  pages        = {1965--1968},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.dam.2008.12.003},
  doi          = {10.1016/J.DAM.2008.12.003},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JacksonJ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JordanRS09,
  author       = {Tibor Jord{\'{a}}n and
                  Andr{\'{a}}s Recski and
                  Zoltan Szabadka},
  title        = {Rigid tensegrity labelings of graphs},
  journal      = {Eur. J. Comb.},
  volume       = {30},
  number       = {8},
  pages        = {1887--1895},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.ejc.2008.12.014},
  doi          = {10.1016/J.EJC.2008.12.014},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/JordanRS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JacksonJ08,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {On the rigidity of molecular graphs},
  journal      = {Comb.},
  volume       = {28},
  number       = {6},
  pages        = {645--658},
  year         = {2008},
  url          = {https://doi.org/10.1007/s00493-008-2287-z},
  doi          = {10.1007/S00493-008-2287-Z},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/JacksonJ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/JacksonJ08,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture},
  journal      = {Discret. Comput. Geom.},
  volume       = {40},
  number       = {2},
  pages        = {258--278},
  year         = {2008},
  url          = {https://doi.org/10.1007/s00454-008-9100-z},
  doi          = {10.1007/S00454-008-9100-Z},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dcg/JacksonJ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Bang-JensenJ08,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {On persistent directed graphs},
  journal      = {Networks},
  volume       = {52},
  number       = {4},
  pages        = {271--276},
  year         = {2008},
  url          = {https://doi.org/10.1002/net.20248},
  doi          = {10.1002/NET.20248},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/Bang-JensenJ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JacksonJ07,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Rigid Components in Molecular Graphs},
  journal      = {Algorithmica},
  volume       = {48},
  number       = {4},
  pages        = {399--412},
  year         = {2007},
  url          = {https://doi.org/10.1007/s00453-007-0170-8},
  doi          = {10.1007/S00453-007-0170-8},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/JacksonJ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/JacksonJS06,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n and
                  Zoltan Szabadka},
  title        = {Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs},
  journal      = {Discret. Comput. Geom.},
  volume       = {35},
  number       = {3},
  pages        = {493--512},
  year         = {2006},
  url          = {https://doi.org/10.1007/s00454-005-1225-8},
  doi          = {10.1007/S00454-005-1225-8},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/JacksonJS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/JacksonJ06,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {On the Rank Function of the 3-dimensional Rigidity Matroid},
  journal      = {Int. J. Comput. Geom. Appl.},
  volume       = {16},
  number       = {5-6},
  pages        = {415--430},
  year         = {2006},
  url          = {https://doi.org/10.1142/S0218195906002117},
  doi          = {10.1142/S0218195906002117},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcga/JacksonJ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jordan06,
  author       = {Tibor Jord{\'{a}}n},
  title        = {A characterization of weakly four-connected graphs},
  journal      = {J. Graph Theory},
  volume       = {52},
  number       = {3},
  pages        = {217--229},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20157},
  doi          = {10.1002/JGT.20157},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Jordan06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BergJ06,
  author       = {Alex R. Berg and
                  Tibor Jord{\'{a}}n},
  title        = {Two-connected orientations of Eulerian graphs},
  journal      = {J. Graph Theory},
  volume       = {52},
  number       = {3},
  pages        = {230--242},
  year         = {2006},
  url          = {https://doi.org/10.1002/jgt.20158},
  doi          = {10.1002/JGT.20158},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BergJ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/FeketeJ06,
  author       = {Zsolt Fekete and
                  Tibor Jord{\'{a}}n},
  editor       = {Sotiris E. Nikoletseas and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Uniquely Localizable Networks with Few Anchors},
  booktitle    = {Algorithmic Aspects of Wireless Sensor Networks, Second International
                  Workshop, {ALGOSENSORS} 2006, Venice, Italy, July 15, 2006, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4240},
  pages        = {176--183},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11963271\_16},
  doi          = {10.1007/11963271\_16},
  timestamp    = {Tue, 14 May 2019 10:00:36 +0200},
  biburl       = {https://dblp.org/rec/conf/algosensors/FeketeJ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/JacksonJ05,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {The Dress conjectures on rank in the 3-dimensional rigidity matroid},
  journal      = {Adv. Appl. Math.},
  volume       = {35},
  number       = {4},
  pages        = {355--367},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.aam.2005.03.004},
  doi          = {10.1016/J.AAM.2005.03.004},
  timestamp    = {Sun, 22 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aam/JacksonJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/FeketeJ05,
  author       = {Zsolt Fekete and
                  Tibor Jord{\'{a}}n},
  title        = {Rigid realizations of graphs on small grids},
  journal      = {Comput. Geom.},
  volume       = {32},
  number       = {3},
  pages        = {216--222},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.comgeo.2005.04.001},
  doi          = {10.1016/J.COMGEO.2005.04.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/FeketeJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BergJ05,
  author       = {Alex R. Berg and
                  Tibor Jord{\'{a}}n},
  title        = {Minimally \emph{k}-Edge-Connected Directed Graphs of Maximal Size},
  journal      = {Graphs Comb.},
  volume       = {21},
  number       = {1},
  pages        = {39--50},
  year         = {2005},
  url          = {https://doi.org/10.1007/s00373-004-0588-6},
  doi          = {10.1007/S00373-004-0588-6},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/BergJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/JacksonJ05,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Rigid Two-Dimensional Frameworks with Three Collinear Points},
  journal      = {Graphs Comb.},
  volume       = {21},
  number       = {4},
  pages        = {427--444},
  year         = {2005},
  url          = {https://doi.org/10.1007/s00373-005-0629-9},
  doi          = {10.1007/S00373-005-0629-9},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/JacksonJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonJ05,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Connected rigidity matroids and unique realizations of graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {94},
  number       = {1},
  pages        = {1--29},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jctb.2004.11.002},
  doi          = {10.1016/J.JCTB.2004.11.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JacksonJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonJ05a,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Independence free graphs and vertex connectivity augmentation},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {94},
  number       = {1},
  pages        = {31--77},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jctb.2004.01.004},
  doi          = {10.1016/J.JCTB.2004.01.004},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JacksonJ05a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonJ05b,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {The \emph{d}-dimensional rigidity matroid of sparse graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {95},
  number       = {1},
  pages        = {118--133},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jctb.2005.03.004},
  doi          = {10.1016/J.JCTB.2005.03.004},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JacksonJ05b.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Jordan05,
  author       = {Tibor Jord{\'{a}}n},
  title        = {On the existence of \emph{k} edge-disjoint 2-connected spanning subgraphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {95},
  number       = {2},
  pages        = {257--262},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.jctb.2005.04.003},
  doi          = {10.1016/J.JCTB.2005.04.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Jordan05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BergJ05,
  author       = {Alex R. Berg and
                  Tibor Jord{\'{a}}n},
  title        = {Sparse certificates and removable cycles in \emph{l}-mixed \emph{p}-connected
                  graphs},
  journal      = {Oper. Res. Lett.},
  volume       = {33},
  number       = {2},
  pages        = {111--114},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.orl.2004.05.008},
  doi          = {10.1016/J.ORL.2004.05.008},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/BergJ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Bang-JensenJ04,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Splitting off edges between two subsets preserving the edge-connectivity
                  of the graph},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {5--28},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00291-7},
  doi          = {10.1016/S0012-365X(03)00291-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Bang-JensenJ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeketeJW04,
  author       = {Zsolt Fekete and
                  Tibor Jord{\'{a}}n and
                  Walter Whiteley},
  editor       = {Susanne Albers and
                  Tomasz Radzik},
  title        = {An Inductive Construction for Plane Laman Graphs via Vertex Splitting},
  booktitle    = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
                  September 14-17, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3221},
  pages        = {299--310},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-30140-0\_28},
  doi          = {10.1007/978-3-540-30140-0\_28},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/FeketeJW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Jordan03,
  author       = {Tibor Jord{\'{a}}n},
  title        = {On minimally k-edge-connected graphs and shortest k-edge-connected
                  Steiner networks},
  journal      = {Discret. Appl. Math.},
  volume       = {131},
  number       = {2},
  pages        = {421--432},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0166-218X(02)00465-1},
  doi          = {10.1016/S0166-218X(02)00465-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Jordan03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BergJJ03,
  author       = {Alex R. Berg and
                  Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Edge splitting and connectivity augmentation in directed hypergraphs},
  journal      = {Discret. Math.},
  volume       = {273},
  number       = {1-3},
  pages        = {71--84},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0012-365X(03)00229-2},
  doi          = {10.1016/S0012-365X(03)00229-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BergJJ03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonJ03,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Non-separable detachments of graphs},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {87},
  number       = {1},
  pages        = {17--37},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0095-8956(02)00026-6},
  doi          = {10.1016/S0095-8956(02)00026-6},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JacksonJ03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BergJ03,
  author       = {Alex R. Berg and
                  Tibor Jord{\'{a}}n},
  title        = {A proof of Connelly's conjecture on 3-connected circuits of the rigidity
                  matroid},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {88},
  number       = {1},
  pages        = {77--97},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0095-8956(02)00037-0},
  doi          = {10.1016/S0095-8956(02)00037-0},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/BergJ03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BergJJ03,
  author       = {Alex R. Berg and
                  Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Highly edge-connected detachments of graphs and digraphs},
  journal      = {J. Graph Theory},
  volume       = {43},
  number       = {1},
  pages        = {67--77},
  year         = {2003},
  url          = {https://doi.org/10.1002/jgt.10104},
  doi          = {10.1002/JGT.10104},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/BergJJ03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JordanS03,
  author       = {Tibor Jord{\'{a}}n and
                  Zolt{\'{a}}n Szigeti},
  title        = {Detachments Preserving Local Edge-Connectivity of Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {17},
  number       = {1},
  pages        = {72--87},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0895480199363933},
  doi          = {10.1137/S0895480199363933},
  timestamp    = {Fri, 23 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/JordanS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Jordan03,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Constrained Edge-Splitting Problems},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {17},
  number       = {1},
  pages        = {88--102},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0895480199364483},
  doi          = {10.1137/S0895480199364483},
  timestamp    = {Fri, 23 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Jordan03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BergJ03,
  author       = {Alex R. Berg and
                  Tibor Jord{\'{a}}n},
  editor       = {Giuseppe Di Battista and
                  Uri Zwick},
  title        = {Algorithms for Graph Rigidity and Scene Analysis},
  booktitle    = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
                  Hungary, September 16-19, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2832},
  pages        = {78--89},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-39658-1\_10},
  doi          = {10.1007/978-3-540-39658-1\_10},
  timestamp    = {Sun, 02 Jun 2019 21:14:37 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BergJ03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/NagamochiJNI02,
  author       = {Hiroshi Nagamochi and
                  Tibor Jord{\'{a}}n and
                  Yoshitaka Nakao and
                  Toshihide Ibaraki},
  title        = {Convex Embeddings and Bisections of 3-Connected Graphs 1},
  journal      = {Comb.},
  volume       = {22},
  number       = {4},
  pages        = {537--554},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00493-002-0006-8},
  doi          = {10.1007/S00493-002-0006-8},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/NagamochiJNI02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JordanP02,
  author       = {Tibor Jord{\'{a}}n and
                  Alessandro Panconesi},
  title        = {Preface},
  journal      = {Random Struct. Algorithms},
  volume       = {20},
  number       = {3},
  pages        = {261},
  year         = {2002},
  url          = {https://doi.org/10.1002/rsa.10040},
  doi          = {10.1002/RSA.10040},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/JordanP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CheriyanJN01,
  author       = {Joseph Cheriyan and
                  Tibor Jord{\'{a}}n and
                  Zeev Nutov},
  title        = {On Rooted Node-Connectivity Problems},
  journal      = {Algorithmica},
  volume       = {30},
  number       = {3},
  pages        = {353--375},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00453-001-0017-7},
  doi          = {10.1007/S00453-001-0017-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CheriyanJN01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FrankJS01,
  author       = {Andr{\'{a}}s Frank and
                  Tibor Jord{\'{a}}n and
                  Zolt{\'{a}}n Szigeti},
  title        = {Combinatorial problems related to origin-destination matrices},
  journal      = {Discret. Appl. Math.},
  volume       = {115},
  number       = {1-3},
  pages        = {37--47},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(01)00213-X},
  doi          = {10.1016/S0166-218X(01)00213-X},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FrankJS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GabowJ01,
  author       = {Harold N. Gabow and
                  Tibor Jord{\'{a}}n},
  title        = {Bipartition constrained edge-splitting in directed graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {115},
  number       = {1-3},
  pages        = {49--62},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0166-218X(01)00214-1},
  doi          = {10.1016/S0166-218X(01)00214-1},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GabowJ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/JacksonJ01,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Non-Separable Detachments of Graphs},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {10},
  pages        = {151--153},
  year         = {2001},
  url          = {https://doi.org/10.1016/S1571-0653(04)00382-8},
  doi          = {10.1016/S1571-0653(04)00382-8},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/JacksonJ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JacksonJ01,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  editor       = {Karen I. Aardal and
                  Bert Gerards},
  title        = {Independence Free Graphs and Vertex Connectivity Augmentation},
  booktitle    = {Integer Programming and Combinatorial Optimization, 8th International
                  {IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2081},
  pages        = {264--279},
  publisher    = {Springer},
  year         = {2001},
  url          = {https://doi.org/10.1007/3-540-45535-3\_21},
  doi          = {10.1007/3-540-45535-3\_21},
  timestamp    = {Tue, 25 Jul 2023 13:14:28 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/JacksonJ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/JacksonJ00,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  title        = {Connectivity Augmentation of Graphs},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {5},
  pages        = {185--188},
  year         = {2000},
  url          = {https://doi.org/10.1016/S1571-0653(05)80158-1},
  doi          = {10.1016/S1571-0653(05)80158-1},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/JacksonJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bang-JensenJ00,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity
                  of the Graph},
  journal      = {J. Algorithms},
  volume       = {37},
  number       = {2},
  pages        = {326--343},
  year         = {2000},
  url          = {https://doi.org/10.1006/jagm.2000.1119},
  doi          = {10.1006/JAGM.2000.1119},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/Bang-JensenJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GabowJ00,
  author       = {Harold N. Gabow and
                  Tibor Jord{\'{a}}n},
  title        = {Incrementing Bipartite Digraph Edge-Connectivity},
  journal      = {J. Comb. Optim.},
  volume       = {4},
  number       = {4},
  pages        = {449--486},
  year         = {2000},
  url          = {https://doi.org/10.1023/A:1009885511650},
  doi          = {10.1023/A:1009885511650},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/GabowJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GabowJ00,
  author       = {Harold N. Gabow and
                  Tibor Jord{\'{a}}n},
  title        = {How to Make a Square Grid Framework with Cables Rigid},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {2},
  pages        = {649--680},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539798347189},
  doi          = {10.1137/S0097539798347189},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GabowJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JacksonJ00,
  author       = {Bill Jackson and
                  Tibor Jord{\'{a}}n},
  editor       = {D. T. Lee and
                  Shang{-}Hua Teng},
  title        = {A Near Optimal Algorithm for Vertex Connectivity Augmentation},
  booktitle    = {Algorithms and Computation, 11th International Conference, {ISAAC}
                  2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1969},
  pages        = {312--325},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-40996-3\_27},
  doi          = {10.1007/3-540-40996-3\_27},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/JacksonJ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jordan99,
  author       = {Tibor Jord{\'{a}}n},
  title        = {Extremal graphs in connectivity augmentation},
  journal      = {J. Graph Theory},
  volume       = {31},
  number       = {3},
  pages        = {179--193},
  year         = {1999},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199907)31:3\&\#60;179::AID-JGT3\&\#62;3.0.CO;2-7},
  doi          = {10.1002/(SICI)1097-0118(199907)31:3\&\#60;179::AID-JGT3\&\#62;3.0.CO;2-7},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Jordan99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jordan99a,
  author       = {Tibor Jord{\'{a}}n},
  title        = {On the number of shredders},
  journal      = {J. Graph Theory},
  volume       = {31},
  number       = {3},
  pages        = {195--200},
  year         = {1999},
  url          = {https://doi.org/10.1002/(SICI)1097-0118(199907)31:3\&\#60;195::AID-JGT4\&\#62;3.0.CO;2-E},
  doi          = {10.1002/(SICI)1097-0118(199907)31:3\&\#60;195::AID-JGT4\&\#62;3.0.CO;2-E},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/Jordan99a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FleinerJ99,
  author       = {Tam{\'{a}}s Fleiner and
                  Tibor Jord{\'{a}}n},
  title        = {Coverings and structure of crossing families},
  journal      = {Math. Program.},
  volume       = {84},
  number       = {3},
  pages        = {505--518},
  year         = {1999},
  url          = {https://doi.org/10.1007/s101070050035},
  doi          = {10.1007/S101070050035},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FleinerJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FrankJ99,
  author       = {Andr{\'{a}}s Frank and
                  Tibor Jord{\'{a}}n},
  title        = {Directed vertex-connectivity augmentation},
  journal      = {Math. Program.},
  volume       = {84},
  number       = {3},
  pages        = {537--553},
  year         = {1999},
  url          = {https://doi.org/10.1007/s101070050038},
  doi          = {10.1007/S101070050038},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/FrankJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GyoriJ99,
  author       = {Ervin Gy{\"{o}}ri and
                  Tibor Jord{\'{a}}n},
  title        = {How to make a graph four-connected},
  journal      = {Math. Program.},
  volume       = {84},
  number       = {3},
  pages        = {555--563},
  year         = {1999},
  url          = {https://doi.org/10.1007/s101070050039},
  doi          = {10.1007/S101070050039},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/GyoriJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChengJ99,
  author       = {Eddie Cheng and
                  Tibor Jord{\'{a}}n},
  title        = {Successive edge-connectivity augmentation problems},
  journal      = {Math. Program.},
  volume       = {84},
  number       = {3},
  pages        = {577--593},
  year         = {1999},
  url          = {https://doi.org/10.1007/s101070050041},
  doi          = {10.1007/S101070050041},
  timestamp    = {Sat, 01 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/ChengJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bang-JensenGJS99,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Harold N. Gabow and
                  Tibor Jord{\'{a}}n and
                  Zolt{\'{a}}n Szigeti},
  title        = {Edge-Connectivity Augmentation with Partition Constraints},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {12},
  number       = {2},
  pages        = {160--207},
  year         = {1999},
  url          = {https://doi.org/10.1137/S0895480197324700},
  doi          = {10.1137/S0895480197324700},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Bang-JensenGJS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CheriyanJR99,
  author       = {Joseph Cheriyan and
                  Tibor Jord{\'{a}}n and
                  R. Ravi},
  editor       = {Jaroslav Nesetril},
  title        = {On 2-Coverings and 2-Packings of Laminar Families},
  booktitle    = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech
                  Republic, July 16-18, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1643},
  pages        = {510--520},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48481-7\_44},
  doi          = {10.1007/3-540-48481-7\_44},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/CheriyanJR99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FrankJS99,
  author       = {Andr{\'{a}}s Frank and
                  Tibor Jord{\'{a}}n and
                  Zolt{\'{a}}n Szigeti},
  editor       = {G{\'{e}}rard Cornu{\'{e}}jols and
                  Rainer E. Burkard and
                  Gerhard J. Woeginger},
  title        = {An Orientation Theorem with Parity Conditions},
  booktitle    = {Integer Programming and Combinatorial Optimization, 7th International
                  {IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1610},
  pages        = {183--190},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48777-8\_14},
  doi          = {10.1007/3-540-48777-8\_14},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/FrankJS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Jordan99,
  author       = {Tibor Jord{\'{a}}n},
  editor       = {G{\'{e}}rard Cornu{\'{e}}jols and
                  Rainer E. Burkard and
                  Gerhard J. Woeginger},
  title        = {Edge-Splitting Problems with Demands},
  booktitle    = {Integer Programming and Combinatorial Optimization, 7th International
                  {IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1610},
  pages        = {273--288},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-48777-8\_21},
  doi          = {10.1007/3-540-48777-8\_21},
  timestamp    = {Mon, 22 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/Jordan99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NagamochiJNI99,
  author       = {Hiroshi Nagamochi and
                  Tibor Jord{\'{a}}n and
                  Yoshitaka Nakao and
                  Toshihide Ibaraki},
  editor       = {Alok Aggarwal and
                  C. Pandu Rangan},
  title        = {Bisecting Two Subsets in 3-Connected Graphs},
  booktitle    = {Algorithms and Computation, 10th International Symposium, {ISAAC}
                  '99, Chennai, India, December 16-18, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1741},
  pages        = {425--434},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-46632-0\_43},
  doi          = {10.1007/3-540-46632-0\_43},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/NagamochiJNI99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GabowJ99,
  author       = {Harold N. Gabow and
                  Tibor Jord{\'{a}}n},
  editor       = {Robert Endre Tarjan and
                  Tandy J. Warnow},
  title        = {How to Make a Square Grid Framework with Cables Rigid},
  booktitle    = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  17-19 January 1999, Baltimore, Maryland, {USA}},
  pages        = {356--365},
  publisher    = {{ACM/SIAM}},
  year         = {1999},
  url          = {http://dl.acm.org/citation.cfm?id=314500.314588},
  timestamp    = {Thu, 05 Jul 2018 07:29:57 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/GabowJ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bang-JensenJ98,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Adding and Reversing Arcs in Semicomplete Digraphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {7},
  number       = {1},
  pages        = {17--25},
  year         = {1998},
  url          = {http://journals.cambridge.org/action/displayAbstract?aid=46561},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Bang-JensenJ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jordan98,
  author       = {Tibor Jord{\'{a}}n},
  title        = {On the existence of (k, l)-critical graphs},
  journal      = {Discret. Math.},
  volume       = {179},
  number       = {1-3},
  pages        = {273--275},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0012-365X(97)00100-3},
  doi          = {10.1016/S0012-365X(97)00100-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Jordan98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Bang-JensenJ98,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Edge-Connectivity Augmentation Preserving Simplicity},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {11},
  number       = {4},
  pages        = {603--623},
  year         = {1998},
  url          = {https://doi.org/10.1137/S0895480197318878},
  doi          = {10.1137/S0895480197318878},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Bang-JensenJ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CheriyanJN98,
  author       = {Joseph Cheriyan and
                  Tibor Jord{\'{a}}n and
                  Zeev Nutov},
  editor       = {Klaus Jansen and
                  Dorit S. Hochbaum},
  title        = {Approximating \emph{k}-outconnected Subgraph Problems},
  booktitle    = {Approximation Algorithms for Combinatorial Optimization, International
                  Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1444},
  pages        = {77--88},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/BFb0053965},
  doi          = {10.1007/BFB0053965},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/CheriyanJN98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bang-JensenGJS98,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Harold N. Gabow and
                  Tibor Jord{\'{a}}n and
                  Zolt{\'{a}}n Szigeti},
  editor       = {Howard J. Karloff},
  title        = {Edge-Connectivity Augmentation with Partition Constraints},
  booktitle    = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
                  25-27 January 1998, San Francisco, California, {USA}},
  pages        = {306--315},
  publisher    = {{ACM/SIAM}},
  year         = {1998},
  url          = {http://dl.acm.org/citation.cfm?id=314613.314721},
  timestamp    = {Thu, 05 Jul 2018 07:29:49 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Bang-JensenGJS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Jordan97,
  author       = {Tibor Jord{\'{a}}n},
  title        = {A Note on the Vertex-Connectivity Augmentation Problem},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {71},
  number       = {2},
  pages        = {294--301},
  year         = {1997},
  url          = {https://doi.org/10.1006/jctb.1997.1786},
  doi          = {10.1006/JCTB.1997.1786},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Jordan97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bang-JensenJ97,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Edge-Connectivity Augmentation Preserving Simplicity},
  booktitle    = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
                  Miami Beach, Florida, USA, October 19-22, 1997},
  pages        = {486--495},
  publisher    = {{IEEE} Computer Society},
  year         = {1997},
  url          = {https://doi.org/10.1109/SFCS.1997.646137},
  doi          = {10.1109/SFCS.1997.646137},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/Bang-JensenJ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Jordan95,
  author       = {Tibor Jord{\'{a}}n},
  title        = {On the Optimal Vertex-Connectivity Augmentation},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {63},
  number       = {1},
  pages        = {8--20},
  year         = {1995},
  url          = {https://doi.org/10.1006/jctb.1995.1002},
  doi          = {10.1006/JCTB.1995.1002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Jordan95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FrankJ95,
  author       = {Andr{\'{a}}s Frank and
                  Tibor Jord{\'{a}}n},
  title        = {Minimal Edge-Coverings of Pairs of Sets},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {65},
  number       = {1},
  pages        = {73--110},
  year         = {1995},
  url          = {https://doi.org/10.1006/jctb.1995.1044},
  doi          = {10.1006/JCTB.1995.1044},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/FrankJ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FrankJ95,
  author       = {Andr{\'{a}}s Frank and
                  Tibor Jord{\'{a}}n},
  editor       = {Egon Balas and
                  Jens Clausen},
  title        = {How to Make a Strongly Connected Digraph Two-Connected},
  booktitle    = {Integer Programming and Combinatorial Optimization, 4th International
                  {IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {920},
  pages        = {414--425},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-59408-6\_69},
  doi          = {10.1007/3-540-59408-6\_69},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/FrankJ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Jordan93,
  author       = {Tibor Jord{\'{a}}n},
  editor       = {Thomas Lengauer},
  title        = {Incresing the Vertex-Connectivity in Directed Graphs},
  booktitle    = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
                  Germany, September 30 - October 2, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {726},
  pages        = {236--247},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57273-2\_59},
  doi          = {10.1007/3-540-57273-2\_59},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/Jordan93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Jordan93,
  author       = {Tibor Jord{\'{a}}n},
  editor       = {Giovanni Rinaldi and
                  Laurence A. Wolsey},
  title        = {Optimal and almost optimal algorithms for connectivity augmentation
                  problems},
  booktitle    = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
                  Conference, Erice, Italy, April 29 - May 1, 1993},
  pages        = {75--88},
  publisher    = {{CIACO}},
  year         = {1993},
  timestamp    = {Wed, 09 Oct 2002 11:26:33 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/Jordan93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/FrankJ91,
  author       = {Andr{\'{a}}s Frank and
                  Tibor Jord{\'{a}}n},
  editor       = {Neil Robertson and
                  Paul D. Seymour},
  title        = {Tree-representation of directed circuits},
  booktitle    = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
                  Research Conference on Graph Minors held June 22 to July 5, 1991,
                  at the University of Washington, Seattle, {USA}},
  series       = {Contemporary Mathematics},
  volume       = {147},
  pages        = {195--202},
  publisher    = {American Mathematical Society},
  year         = {1991},
  timestamp    = {Fri, 27 Aug 2021 14:49:51 +0200},
  biburl       = {https://dblp.org/rec/conf/gst/FrankJ91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics