Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Johannes Zink"'
Publikováno v:
Systematic Reviews, Vol 13, Iss 1, Pp 1-14 (2024)
Abstract Background Systematically screening published literature to determine the relevant publications to synthesize in a review is a time-consuming and difficult task. Large language models (LLMs) are an emerging technology with promising capabili
Externí odkaz:
https://doaj.org/article/e6aea04a17174119b8bf4951623b0c50
Autor:
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031222023
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$, $c(u) \ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70d821510da1db569ea7e7f8426a3426
https://ruj.uj.edu.pl/xmlui/handle/item/307964
https://ruj.uj.edu.pl/xmlui/handle/item/307964
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:
Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::974d58935f273bf6e0bc46b905036caf
https://doi.org/10.1007/978-3-031-15914-5_20
https://doi.org/10.1007/978-3-031-15914-5_20
Publikováno v:
2021 13th IFIP Wireless and Mobile Networking Conference (WMNC).
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030895426
COCOON
COCOON
The Polyline Bundle Simplification (PBS) problem is a generalization of the classical polyline simplification problem. Given a set of polylines, which may share line segments and points, PBS asks for the smallest consistent simplification of these po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::976faada3ee00cda9e87a2cbe74404c0
https://doi.org/10.1007/978-3-030-89543-3_20
https://doi.org/10.1007/978-3-030-89543-3_20
Autor:
Jonathan Klawitter, Johannes Zink
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030929305
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b8d5982bf2b504f0bbd4abfaee9c2c1
https://doi.org/10.1007/978-3-030-92931-2_11
https://doi.org/10.1007/978-3-030-92931-2_11
Autor:
Alexander Wolff, Florian Thiele, Alexander Zaft, Johannes Zink, Andre Löffler, Philipp Kindermann, Steven Chaplick
Publikováno v:
Journal of Graph Algorithms and Applications, 24(4), 657-681. Brown University
Stick graphs are intersection graphs of horizontal and vertical line segments that all touch a line of slope −1 and lie above this line. De Luca et al. [GD'18] considered the recognition problem of stick graphs when no order is given (STICK), when
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f46a3601dc955bdeaebfa8ba7d1258c
https://cris.maastrichtuniversity.nl/en/publications/a237e626-452c-492f-b2dd-3feae473e213
https://cris.maastrichtuniversity.nl/en/publications/a237e626-452c-492f-b2dd-3feae473e213
The aim of this research is a practical method to draw cable plans of complex machines. Such plans consist of electronic components and cables connecting specific ports of the components. Since the machines are configured for each client individually
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::071016c1479966d3248a46a8fdf449c8
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030687656
Graph Drawing
Graph Drawing
The aim of this research is a practical method to draw cable plans of complex machines. Such plans consist of electronic components and cables connecting specific ports of the components. Since the machines are configured for each client individually
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b108ea468a40e5773bf78f60caa8a8a
https://doi.org/10.1007/978-3-030-68766-3_18
https://doi.org/10.1007/978-3-030-68766-3_18