Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Daniel Neuwirth"'
Publikováno v:
Plasma, Vol 4, Iss 3, Pp 399-407 (2021)
The negative air ions (NAI) are used for the removal of particles or droplets from the air. In this study, three types of piezoelectric cold plasma generators (PCPG), in combination with cylindrical electrostatic ion filters, are applied for NAI prod
Externí odkaz:
https://doaj.org/article/4d51ca3b41ca419886a9892bba9f7265
Publikováno v:
Plasma
Volume 4
Issue 3
Pages 29-407
Plasma, Vol 4, Iss 29, Pp 399-407 (2021)
Volume 4
Issue 3
Pages 29-407
Plasma, Vol 4, Iss 29, Pp 399-407 (2021)
The negative air ions (NAI) are used for the removal of particles or droplets from the air. In this study, three types of piezoelectric cold plasma generators (PCPG), in combination with cylindrical electrostatic ion filters, are applied for NAI prod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1d8ea311cd5fac18e692d07c533379f
https://doi.org/10.3390/plasma4030029
https://doi.org/10.3390/plasma4030029
Autor:
Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Christopher Auer, Daniel Neuwirth, Christian Bachmaier, Josef Reislhuber
Publikováno v:
Algorithmica. 83:3534-3535
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e6399877971ec9e3c736fc2ea2d5e6
https://doi.org/10.1007/s00453-021-00874-z
https://doi.org/10.1007/s00453-021-00874-z
Autor:
A. V. Pipa, Dominik Berndt, Daniel Neuwirth, Ingo Ehrlich, Karl Tschurtschenthaler, Ronny Brandenburg, Alexander Max, Matthias Lindner, Rüdiger Foest, Norbert Karpen, Rüdiger Hink, Elmar Bonaccurso, Robert Weichwald, Ralf Caspari, Rupert Schreiner, Bastian Jungbauer
Publikováno v:
AIAA AVIATION 2020 FORUM.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ecfcf256d60805fca3d2c8e01b61ef35
https://doi.org/10.2514/6.2020-3243
https://doi.org/10.2514/6.2020-3243
Publikováno v:
Journal of Graph Algorithms and Applications. 21:281-312
A graph is called a bar 1-visibility graph, if its vertices can be represented as horizontal vertex-segments, called bars, and each edge corresponds to a vertical line of sight which can traverse another bar. If all bars are aligned at one side, then
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa9a39de0edfdd499b500c2cde415615
https://doi.org/10.7155/jgaa.00417
https://doi.org/10.7155/jgaa.00417
Publikováno v:
Theoretical Computer Science. 575:71-89
In this work we investigate the complexity of some problems related to the {\em Simultaneous Embedding with Fixed Edges} (SEFE) of $k$ planar graphs and the PARTITIONED $k$-PAGE BOOK EMBEDDING (PBE-$k$) problems, which are known to be equivalent unde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c7adb87accae1cdbc54de5d8a1b6c66
https://doi.org/10.1016/j.tcs.2014.11.016
https://doi.org/10.1016/j.tcs.2014.11.016
Autor:
Ueli Heiz, Martin Tschurl, Max Wiedemann, J. F. Eckhard, Daniel Neuwirth, Richard Schröter, Bradley Visser, Kathrin Lange
Publikováno v:
International Journal of Mass Spectrometry. 387:8-15
An experimental setup is presented, which consists of a laser vaporization cluster source, various ion optics for ion guidance, a quadrupole mass filter for mass selection, a ring electrode ion trap for ion storage and a reflectron time-of-flight mas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1dd74e766eb2a2cca7825f3df199f07
https://doi.org/10.1016/j.ijms.2015.06.011
https://doi.org/10.1016/j.ijms.2015.06.011
Autor:
Josef Reislhuber, Christian Bachmaier, Kathrin Hanauer, Franz J. Brandenburg, Andreas Gleiβner, Christopher Auer, Daniel Neuwirth
Publikováno v:
Algorithmica. 74:1293-1320
A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs generalize outerplanar graphs, which can be recognized in linear time, and specialize 1-pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1548d442ff97d99d6b728366091f5985
https://doi.org/10.1007/s00453-015-0002-1
https://doi.org/10.1007/s00453-015-0002-1
Autor:
Christian Bachmaier, Daniel Neuwirth, Kathrin Hanauer, Josef Reislhuber, Franz J. Brandenburg
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. NIC-planarity generalizes IC-planarity, which allows a vertex to be incident t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cee46f39487d73e6f9a9ecbdc2194f8
