Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Wagner, Mirko H."'
Autor:
Asiri, Zayed, Burdett, Ryan, Chimani, Markus, Haythorpe, Michael, Newcombe, Alex, Wagner, Mirko H.
Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the establishment of coincident upper and lower bounds; the former is usually
Externí odkaz:
http://arxiv.org/abs/2409.06755
Autor:
Balko, Martin, Hliněný, Petr, Masařík, Tomáš, Orthaber, Joachim, Vogtenhuber, Birgit, Wagner, Mirko H.
Visualizing a graph $G$ in the plane nicely, for example, without crossings, is unfortunately not always possible. To address this problem, Masa\v{r}\'ik and Hlin\v{e}n\'y [GD 2023] recently asked for each edge of $G$ to be drawn without crossings wh
Externí odkaz:
http://arxiv.org/abs/2407.21206
Autor:
Chimani, Markus, Donzelmann, Torben, Kloster, Nick, Koch, Melissa, Völlering, Jan-Jakob, Wagner, Mirko H.
Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the traditional
Externí odkaz:
http://arxiv.org/abs/2407.05057
Given a weighted graph $G$, a minimum weight $\alpha$-spanner is a least-weight subgraph $H\subseteq G$ that preserves minimum distances between all node pairs up to a factor of $\alpha$. There are many results on heuristics and approximation algorit
Externí odkaz:
http://arxiv.org/abs/2406.19164
In multi-objective optimization, several potentially conflicting objective functions need to be optimized. Instead of one optimal solution, we look for the set of so called non-dominated solutions. An important subset is the set of non-dominated extr
Externí odkaz:
http://arxiv.org/abs/2207.09155
Autor:
Bokal, Drago, Chimani, Markus, Nover, Alexander, Schierbaum, Jöran, Stolzmann, Tobias, Wagner, Mirko H., Wiedera, Tilo
A $c$-crossing-critical graph is one that has crossing number at least $c$ but each of its proper subgraphs has crossing number less than $c$. Recently, a set of explicit construction rules was identified by Bokal, Oporowski, Richter, and Salazar to
Externí odkaz:
http://arxiv.org/abs/2112.04854
Given a graph $G=(V,E)$, the longest induced path problem asks for a maximum cardinality node subset $W\subseteq V$ such that the graph induced by $W$ is a path. It is a long established problem with applications, e.g., in network analysis. We propos
Externí odkaz:
http://arxiv.org/abs/2002.07012
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Mathematical Methods of Operations Research; Aug2022, Vol. 96 Issue 1, p149-160, 12p