Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Oksana Firman"'
Autor:
Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd72b81505b6e6ebff366473e50c80a8
https://doi.org/10.1007/978-3-031-22203-0_31
https://doi.org/10.1007/978-3-031-22203-0_31
Autor:
Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031231001
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2674e7fac5c483d45cb733c21b112f0
https://doi.org/10.1007/978-3-031-23101-8_1
https://doi.org/10.1007/978-3-031-23101-8_1
Autor:
Oksana Firman, Joachim Spoerhase
Publikováno v:
WALCOM: Algorithms and Computation
Lecture Notes in Computer Science
WALCOM: Algorithms and Computation ISBN: 9783030967307
Lecture Notes in Computer Science
WALCOM: Algorithms and Computation ISBN: 9783030967307
We propose a new representation of $k$-partite, $k$-uniform hypergraphs (i.e. a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for short) by a fin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b33198b9f4e0d0120969879c7893784f
https://hdl.handle.net/21.11116/0000-000C-26B3-F
https://hdl.handle.net/21.11116/0000-000C-26B3-F
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030358013
Graph Drawing
Graph Drawing
We study the following combinatorial problem. Given a set of n y-monotone wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders of the wires on any two consecutive layers differ only in swaps of neigh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97206d74b36ccba06e9940379080e1f5
https://doi.org/10.1007/978-3-030-35802-0_16
https://doi.org/10.1007/978-3-030-35802-0_16