SHAHROKHI, F. - SÝKORA, O. - SZÉKELY, L. A. - VRŤO, Imrich. A new lower bound for the bipartite crossing number with applications. F. Shahrokhi, O. Sýkora, L.A. Székely, I. Vrťo. In Theoretical Computer Science, 2000, vol. 245, p. 281-294. ISSN 0304-3975.
Ohlasy:
[1.1] SRIVASTAVA, K. - SHARMA, R. A Hybrid Simulated Annealing algorithm for the Bipartite Crossing Number Minimization Problem. In 2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, 2008, p. 2948-2954., Registrované v: WOS
[1.1] UHLMANN, J. - WELLER, M. Two-Layer Planarization Parameterized by Feedback Edge Set. In THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS. ISSN 0302-9743, 2010, vol. 6108, p. 431-442., Registrované v: WOS
[3] STALLMANN, M.F. A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. In Journal on Experimental Algorithms, ISSN 1084-6654, 2012, vol. 17, Art. No. 1.3.
[1.1] UHLMANN, J. - WELLER, M. Two-Layer Planarization parameterized by feedback edge set. In THEORETICAL COMPUTER SCIENCE. ISSN 0304-3975, JUL 8 2013, vol. 494, p. 99-111., Registrované v: WOS
[1.1] SCHAEFER, M. The graph crossing number and its variants: A survey. In The Electronic Journal of Combinatorics, ISSN 1077-8926, 2013, vol. 20, #DS21., Registrované v: WOS
[1.2] SCHAEFER, Marcus. The graph crossing number and its variants: A survey. In Electronic Journal of Combinatorics, 2018, vol. 1, dynamicSurveys, art. no. DS21., Registrované v: SCOPUS
[1.1] PALUBECKIS, Gintaras - TOMKEVICIUS, Arunas - OSTREIKA, Armantas. Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization. In APPLIED MATHEMATICS AND COMPUTATION. ISSN 0096-3003, 2019, vol. 348, p. 84-101., Registrované v: WOS