106 Infos zu Kathrin Hanauer

4 Aktuelle Nachrichten

Privatdozent Dr. Dennis Gräf wurde der Karl-Heinz-Pollok-Gedächtnispreis des Neuburger Gesprächskreises für Wissenschaft und Praxis an der Universität...

Kathrin Hanauer, U Vienna; Prof. Dr. Volker Lindenstruth, FIAS & U Frankfurt; Prof. Dr. Christian Scheideler, U Paderborn; Dr ... › events

— Die Botschaft und die Stimmung waren wichtig, und das kam alles super rüber", fand Ann-Kathrin Hanauer. Die Inad-Theatergruppe hat eine ... › regional › region › emotionale...

Brustkrebs - die häufigste bösartige Erkrankung bei Frauen. Doch es muss nicht bei dieser schlechten Nachricht bleiben: Denn bei Früherkennung liegen die...

2  Bilder zu Kathrin Hanauer

5 Profile in Sozialen Netzwerken

StayFriends - Schulfreunde wiederfinden

StayFriends - Schulfreunde wiederfinden

StayFriends - Schulfreunde wiederfinden

› kalyi

1 Business-Profile

servicemitarbeiterin / Eschenlohe / teamfahig, ehrgeizig, selbstbewusst / , Hotel Alpenblick

4 Persönliche Webseiten

Login with Facebook. 2 Domain(s) Use Kathrin Hanauer As Whois Name Contact. Search domains by contact's email. Search domains by contact's name ...

— [2] Fully Dynamic Single-Source Reachability in Practice: An Experimental Study, Kathrin Hanauer, Monika Henzinger and Christian Schulz ... › disjoin...

› kat...

Brandenburg and Kathrin Hanauer, University of Passau Germany. The data that gets read in is an adjacency matrix, that gets converted to an ...

10 Bücher zum Namen

Kathrin Hanauer, Affiliation: University of Vienna, Position: Postdoctoral Researcher at University of Vienna, Location: Vienna

› author

Title, Linear Orderings of Sparse Graphs. Author, Kathrin Hanauer. Contributor, Franz-Josef Brandenburg. Publisher, Universität Passau, Export Citation ...

This book constitutes the thoroughly refereed post-conference proceedings of the 21st International Symposium on Graph Drawing, GD 2013, held in Bordeaux,...

7 Dokumente

von K Hanauer · · Zitiert von: 1 — Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. Authors:Kathrin Hanauer, Monika Henzinger, Stefan Schmid, ... › cs

Linear orderings of sparse graphs by Kathrin Hanauer( Book ) 2 editions published between and in English and held by 35 WorldCat member libraries ... › identities

Franz J. Brandenburg · Andreas Gleißner · Kathrin Hanauer.

Submission history. From: Kathrin Hanauer [view email] [v1] Tue, 25 Aug :34:55 UTC (262 KB). Full-text links: ...

15 Wissenschaftliche Publikationen

List of computer science publications by Kathrin Hanauer

› Persons

Kathrin Hanauer, Monika Henzinger, Christian Schulz: Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX ...

List of computer science publications by Franz-Josef Brandenburg

6 Allgemeine Veröffentlichungen

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. It is maximal 1-planar if the addition of any edge violates...

Authors; Authors and affiliations. Christopher Auer; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer. Christopher Auer. 1. Franz J. Brandenburg. 1.

von C Auer · · Zitiert von: 7 — Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner & Kathrin Hanauer. Authors. Christopher Auer. View author publications. › chapter

Kathrin Hanauer. 1. Franz J. Brandenburg. 1. Christopher Auer University of PassauGermany. Conference paper Downloads. Part of the Lecture Notes ...

1 Video- & Audioinhalte

Speaker Christopher Auer, Martin Balko, Kathrin Hanauer, Seok-Hee ... Josef Reislhuber Martin Balko Kathrin Hanauer, Franz J. Brandenburg, ...

4 Meinungen & Artikel

Franz Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber. Proc. 20th Int. Symp. › wiki ›

Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber. 21st International Symposium, GD 2013, Bordeaux, France, September

Характеризация запрещёнными графами — это метод описания семейства графов или Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber.

Kommentare und Erfahrungsberichte - 4 CLUBS 1 PREIS am Samstag, Q-Club in München

44 Webfunde aus dem Netz

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner and Kathrin Hanauer. The Duals of Upward Planar Graphs on Cylinders.

› citations

Publications by 'Kathrin Hanauer' ... Tight Upper Bounds for Minimum Feedback Arc Sets of Regular GraphsKathrin Hanauer, Franz-Josef Brandenburg, ...

... Sub menu 4; Uncategorized · HomeSearch Results. Search Results for: dblp Kathrin Hanauer. No internet connection No internet connection. example banner  ...

Kathrin Hanauer. Tracking 324 commits to 8 open source packages. Repositories. kalyi/tidybib. Tidy up BibTeX files. GPL Last pushed Dec 4, stars ...

› kalyi

› a-hanauer

(Java) Programmieren mit vim Kathrin Hanauer 21. Juni /10 Programm übersetzen und ausführen eingebauter Befehl: :mak oder :make führt standardmäÿig make aus ...

Bibliographic content of CoRR May 2019

This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Symposium on Graph Drawing, GD 2012, held in

Kathrin Hanauer . -Kolpingsfamilie. Annemarie Allgäuer Katholischer Frauenbund. Irene Brix Katholisches Männerwerk. Josef

Autoren: Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

A graph layout describes the processing of a graph G by a data structure

Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua. Loosely-Stabilizing Phase Clocks and the Adaptive Majority Problem Petra Berenbrink, Felix Biermeier, ... › a...

Kathrin Hanauer, Monika Henzinger and Christian Schulz. Reverse-Safe Data Structures for Text Indexing Giulia Bernardini, Huiping Chen, Gabriele Fici, ...

Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications; Kathrin Hanauer, Christian Schulz and Jonathan Trummer › node

Kathrin Hanauer, Monika Henzinger, Christian Schulz: Faster Fully Dynamic Transitive Closure. 18th International Symposium on Experimental Algorithms, ...

A graph is upward planar if it can be drawn without edge crossings such that all edges point upward. Upward planar graphs have been studied on the

Authors: Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer. Publisher: Springer International Publishing. Published in: Graph ...

... Leonidas J. Guibas · Publications with Siddhartha Gupta · Publications with Kathrin Hanauer · Publications with Sariel Har-Peled · Publications with David Hart ...