Felsner, Stefan - Institut für Mathematik, Technische Universität Berlin

• Prof. Dr. Stefan Felsner Institut fur Mathematik
• Sorting Using Networks of Stacks and Queues Stefan Felsner
• 7. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 3. June
• Technische Universitat Berlin ADM I Graphen und Netzwerkalgorithmen Institut fur Mathematik Sommersemester 2007
• Triangles in Euclidean Arrangements Stefan Felsner and Klaus Kriegel
• KOLLOQUIUM UBER KOMBINATORIK 12. UND 13. NOVEMBER 2004 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• 13. und 14. Universitt
• 2. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 24. April
• Ubung zur Vorlesung: Felsner/Baier Diskrete Strukturen I Kombinatorik 9. Mai 2005
• Chordal Graphs as Intersection Graphs of Pseudosegments
• Ubung zur Vorlesung: Felsner/Baier Diskrete Strukturen II Graphentheorie 4. Januar 2006
• The LinearExtensionDiameter of a Poset Stefan Felsner 1 and Klaus Reuter 2
• FINITE THREE DIMENSIONAL PARTIAL ORDERS WHICH ARE NOT SPHERE ORDERS
• RC23411 (W0409-066) September 10, 2004 Mathematics
• Grid Orientations, (d, d + 2)Polytopes and
• A Theorem on Higher Bruhat Orders Stefan Felsner and Helmut Weil
• Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices
• Colorings of Diagrams of Interval Orders and ffSequences of Sets
• UBER KOMBINATORIK 12. UND NOVEMBER 2004 OTTOVONGUERICKEUNIVERSIT MAGDEBURG
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• More Bounds for the Dimension of Interval Orders 1 and M. Morvan
• 3. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 06. Mai
• Sweeps, Arrangements and Signotopes Stefan Felsner and Helmut Weil
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f ur Di. 4.Mai
• KOLLOQUIUM UBER KOMBINATORIK --14. UND 15. NOVEMBER 2008
• Ubung zur Vorlesung: Felsner/Baier Diskrete Strukturen II Graphentheorie 14. Dezember 2005
• 6. Practice sheet for the lecture: Felsner/ Heldt, Knauer Combinatorics (DS I) 12. Mai
• Balancing Pairs and the Cross Product Conjecture
• Orthogonal Structures in Directed Graphs Stefan Felsner
• Bounds for the Jump Number of Partially Ordered Sets Stefan Felsner
• On the Complexity of Partial Order Properties Stefan Felsner Dorothea Wagner y
• ColoringsofDiagramsofIntervalOrders and -SequencesofSets
• Tolerance Graphs and Orders Stefan Felsner
• 3-INTERVAL IRREDUCIBLE PARTIALLY ORDERED SETS STEFAN FELSNER
• Note: Semi-Order Dimension Two is a Compara-bility Invariant
• On-Line Chain Partitions of Orders Stefan Felsner
• The Linear-Extension-Diameter of a Poset Stefan Felsner1 and Klaus Reuter2
• Point-sets with few k-sets Helmut Alt? Stefan Felsner Ferran Hurtadoy Marc Noyy
• THE MAXIMUM NUMBER OF EDGES IN A GRAPH OF BOUNDED DIMENSION,
• Lattice Structures from Planar Graphs Stefan Felsner
• Grid Orientations, (d, d + 2)-Polytopes and
• Empty Rectangles and Graph Dimension Stefan Felsner
• Orthogonal Surfaces and their CP-orders Stefan Felsner and Sarah Kappes
• Bijections for Baxter Families and Related Stefan Felsner
• Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets
• ON-LINE CHAIN PARTITIONS OF UP-GROWING SEMI-ORDERS STEFAN FELSNER, KAMIL KLOCH, GRZEGORZ MATECKI, AND PIOTR MICEK
• Contact representations of planar graphs with Stefan Felsner
• Max Pfeffer, max.pfeffer@gmx.net ABSCHLUSSBERICHT FR DAS ERASMUS-JAHR 08/09
• 1. Practice sheet for the lecture: Felsner/ Heldt Combinatorics (DS I) 7. April
• 2. Practice sheet for the lecture: Felsner/ Heldt, Knauer Combinatorics (DS I) 18. April
• 4. Practice sheet for the lecture: Felsner/Heldt, Knauer Combinatorics (DS I) 29. April
• 7. Practice sheet for the lecture: Felsner/ Heldt, Knauer Combinatorics (DS I) 20. May
• 8. Practice sheet for the lecture: Felsner/Heldt, Knauer Combinatorics (DS I) 30. May
• 5. Ubung zur Vorlesung: Ordnungstheorie Felsner 21. Mai 2010
• 6. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 19. November
• 7. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 25. November
• 9. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 07. Januar
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• 3. Ubung zur Vorlesung: Felsner/ Heldt Algorithmische Geometrie (KG II) 30. Oktober
• 5. Ubung zur Vorlesung: Felsner/ Heldt Algorithmische Geometrie (KG II) 20. November
• 11. Ubung zur Vorlesung: Felsner/ Heldt Algorithmische Geometrie (KG II) 15. Januar
• Prof Dr. Stefan Felsner Technische Universitat Berlin
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• Registration (no later than October 15, 2008) Colloquium on Combinatorics 2008
• KOLLOQUIUM UBER KOMBINATORIK 14. UND 15. NOVEMBER 2008 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• Der Diskrete Mathe-Schulerwettbewerb Wettbewerbsaufgaben Zahlen
• www.math.tu-berlin.de/~felsner/DMSWe 15.September
• KOLLOQUIUM UBER KOMBINATORIK 13. UND 14. NOVEMBER 2009 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• 1. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 17. April
• 6. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 20. Mai
• 8. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 12. June
• 9. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 23. June
• 10. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 01. July
• Abschlussbericht ber den Erasmusaustausch des Instituts fr Mathematik der TU Berlin mit dem Department of Mathematics
• Abschlussbericht Erasmusjahr in Durham/UK Andreas Wiese, 2005/06
• Zwischenbericht Claudia Jung
• Zwischenbericht -ERASMUS-Jahr in Durham, England Konrad Khn, 2006/2007
• Erasmus-Abschlussbericht Anmerkung................................................................................................................................. 2
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• Registration (no later than October 15, 2007) Colloquium on Combinatorics
• Martin Aigner: The Independence Polynomial of a Graph Susanne Albers: Network Design Games
• 7. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 3. June
• Tolerance Graphs and Orders Stefan Felsner
• Interval Orders: Combinatorial Structure and Algorithms
• Embeddings of Planar Graphs Lecture 13 Dimension
• Interval Orders: Combinatorial Structure and Algorithms
• Parameters of Bar k-Visibility Graphs Stefan Felsner and Mareike Massow
• Bounds for the Jump Number of Partially Ordered Sets Stefan Felsner # , TU Berlin
• On the Order Dimension of Outerplanar Maps Stefan Felsner
• Convex drawings of Planar Graphs and the Order Dimension of 3-Polytopes
• Balancing Pairs and the Cross Product Conjecture
• Trapezoid Graphs and Generalizations, Geometry and Algorithms
• Coding and Counting Arrangements of Pseudolines
• On the Interplay between Interval Dimension and Dimension
• 4. Ubung zur Vorlesung: Ordnungstheorie Felsner 12. Mai 2010
• susanne.gutheil@googlemail.com Berlin : Techno
• On the Order Dimension of Outerplanar Maps Stefan Felsner
• Storage Area Network Optimization A cooperation of Ancor Communications, Minneapolis, USA
• A better proof of Theorem 8.9 In the book the Laman Property is defined on the basis of edge sets
• Orthogonal Surfaces and their CPorders Stefan Felsner and Sarah Kappes
• Zonotopes Associated with Higher Bruhat Orders Stefan Felsner
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 4. Juli
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 2. Mai
• arXiv:1001.3534v1 Cubic Time Recognition of Cocircuit Graphs of
• Journal of Graph Algorithms and Applications http://jgaa.info/
• Infeasibility of Systems of Halfspaces Stefan Felsner and Nicole Morawe
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f allig Di. 20. April
• ULD-Lattices and -Bonds Stefan Felsner1
• Abstracts of invited lectures The Independence Polynomial of a Graph
• 3. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 06. Mai
• Intersection Graphs of Pseudosegments: Chordal Graphs #
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 25. April
• KOLLOQUIUM UBER KOMBINATORIK 13. UND 14. NOVEMBER 2009 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• Distributive Lattices, Polyhedra, and Generalized Flow
• ON-LINE CHAIN PARTITIONING OF UP-GROWING ORDERS: THE CASE OF 2-DIMENSIONAL ORDERS AND SEMI-ORDERS
• Triangles in Euclidean Arrangements Stefan Felsner and Klaus Kriegel
• On the Complexity of Partial Order Properties Stefan Felsner \Lambda Dorothea Wagner y
• ONLINE CHAIN PARTITIONING OF UPGROWING ORDERS: THE CASE OF 2DIMENSIONAL ORDERS AND SEMIORDERS
• Bijections for Baxter Families and Related Stefan Felsner #
• Hamiltonicity and Colorings of Arrangement Graphs
• Markov Chains for Linear Extensions, the TwoDimensional Case
• Planare Graphen Stefan Felsner
• Erfahrungsbericht Durham 2003-2004
• A 3/2-Approximation Algorithm for the Jump Number of Interval Orders
• The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene
• Abstracts of invited lectures Quasirandom Rumor Spreading
• Abschlussbericht ber mein Erasmus-Auslandsjahr
• DIMENSION, GRAPH AND HYPERGRAPH COLORING STEFAN FELSNER AND WILLIAM. T. TROTTER
• Curriculum Vitae # Stefan Felsner
• ON-LINE CHAIN PARTITIONS OF UP-GROWING SEMI-ORDERS STEFAN FELSNER, KAMIL KLOCH, GRZEGORZ MATECKI, AND PIOTR MICEK
• ULDLattices and #Bonds Stefan Felsner 1 & Kolja B. Knauer 2
• Geodesic Embeddings and Planar Graphs Stefan Felsner
• Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number
• On the Number of Planar Orientations with Prescribed Degrees # Stefan Felsner Florian Zickfeld
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• ADJACENCY POSETS OF PLANAR GRAPHS STEFAN FELSNER, CHING MAN LI, AND WILLIAM T. TROTTER
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f ur Di. 18. Mai
• Convex Drawings of 3Connected Plane Graphs Nicolas Bonichon 1 Stefan Felsner 2 Mohamed Mosbah 1
• ON-LINE DIMENSION FOR POSETS EXCLUDING TWO LONG INCOMPARABLE CHAINS
• KOLLOQUIUM UBER KOMBINATORIK --16. UND 17. NOVEMBER 2007
• Empty Rectangles and Graph Dimension Stefan Felsner
• Diplomarbeit Fachbereich Mathematik
• 9. Practice sheet for the lecture: Felsner/Heldt, Knauer Combinatorics (DS I) 7. June
• Abschlussbericht Auslandssemester in Granada
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f ur Di. 6. Juli
• Ubung zur Vorlesung: Felsner/Baier Graphentheorie 29. Oktober 2003
• Note: SemiOrder Dimension Two is a Compara bility Invariant
• Planar Embeddings Lecture 5 Tutte: How to draw a graph 1961
• Schnyder Woods and Orthogonal Surfaces Stefan Felsner Florian Zickfeld
• 1 Planar graphs Definition 1. A drawing of a graph G = (V, E) on some space X is an injective
• 3. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 29. Oktober
• Embeddings of Planar Graphs. March 20, 2006. 11:0012:30. Theorem 1 If a graph G has a drawing such that any pair of edges has an even number of
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f ur Di. 11. Mai
• OnLine Chain Partitions of Orders Stefan Felsner
• COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 64. COMBINATORICS, KESZTHELY (HUNGARY), 1993
• Abstracts of invited lectures The Independence Polynomial of a Graph
• Maximum kChains in Planar Point Sets: Combinatorial Structure and Algorithms \Lambda
• On the Number of Arrangements of Pseudolines Stefan Felsner
• Prof. Dr. Stefan Felsner Institut f ur Mathematik
• Martin Aigner: The Independence Polynomial of a Graph Susanne Albers: Network Design Games
• Technische Universitat Berlin ADM I Graphen und Netzwerkalgorithmen Institut fur Mathematik Sommersemester 2007
• Andreas Stckle Auslandsjahr 2007/ 2008 andreasstoeckle@web.de
• Diskrete Mathematik Stefan Felsner
• THE MAXIMUM NUMBER OF EDGES IN A GRAPH OF BOUNDED DIMENSION,
• Linear Extension Diameter of Downset Lattices of 2Dimensional Posets
• 1 Geometric Graphs: Turan Problems The first part of this chapter collects rather elementary and well known material: We
• 4. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 04. November
• GRAPHENTHEORIE Inhaltsverzeichnis
• FINITE THREE DIMENSIONAL PARTIAL ORDERS WHICH ARE NOT SPHERE ORDERS
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• Markov Chains for Linear Extensions, the Two-Dimensional Case
• 3. Practice sheet for the lecture: Felsner/ Heldt, Knauer Combinatorics (DS I) 21. April
• 10. Practice sheet for the lecture: Felsner/Heldt, Knauer Combinatorics (DS I) 10. June
• Diploma Thesis FB Mathematik und Informatik
• COLLOQUIA MATHEMATICA SOCIETATIS J ' ANOS BOLYA I
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 20. Juni
• Distributive Lattices, Polyhedra, and Generalized Flow
• KOLLOQUIUM UBER KOMBINATORIK --12. UND 13. NOVEMBER 2004
• KOLLOQUIUM UBER KOMBINATORIK 16. UND 17. NOVEMBER 2007 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• Titel des Moduls: LP (nach ECTS): Kurzbezeichnung: Proseminar Codierungstheorie
• Constructing Colorings for Diagrams Stefan Felsnery
• 2. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 24. April
• Schranken f ur F arbungs-und Cliquen uberdeckungszahl geometrisch
• Pointsets with few ksets Helmut Alt ? Stefan Felsner \Lambda Ferran Hurtado y Marc Noy y
• 9. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 23. June
• 10. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 01. July
• On the Interplay between Interval Dimension and Dimension \Lambda
• POSETS AND PLANAR GRAPHS STEFAN FELSNER AND WILLIAM T. TROTTER
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f allig Di. 27. April
• Ubung ``Graphen, Zufall, Algorithmen'' SoSe 2004 S. Felsner f ur Di. 22. Juni
• Ubung zur Vorlesung: Felsner/Baier Diskrete Strukturen I Kombinatorik 23. Mai 2005
• Points with Large Quadrant Depth Roel Apfelbaum Itay Ben-Dan y Stefan Felsner z Tillmann Miltzow x
• 4. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 08. Mai
• 8. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 12. June
• Abstracts of invited lectures Quasirandom Rumor Spreading
• 2. Ubung zur Vorlesung: Felsner/ Heldt Algorithmische Geometrie (KG II) 22. Oktober
• 4. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 08. Mai
• Block Course Embedding Planar Graphs First Lecture
• 5. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 12. November
• Asymptotic enumeration of orientations Stefan Felsner
• ERASMUS EXCHANGES ACADEMIC YEAR 2005/2006
• DIMENSION, GRAPH AND HYPERGRAPH COLORING STEFAN FELSNER AND WILLIAM. T. TROTTER
• A 3/2Approximation Algorithm for the Jump Number of Interval Orders \Lambda
• 5. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 15. Mai
• Graphenalgorithmen: Perfekte Graphen
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 13. Juni
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• 5. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 15. Mai
• Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• On the Number of Arrangements of Pseudolines Stefan Felsner
• 3. Ubung zur Vorlesung: Ordnungstheorie Felsner 4. Mai 2010
• Schnyder Woods and Orthogonal Surfaces Stefan Felsner Florian Zickfeld
• A Theorem on Higher Bruhat Orders Stefan Felsner and Helmut Weil
• Zuf allige Erzeugung von Catalan-Strukturen Diplomarbeit von Dorothea Rochusch
• 3INTERVAL IRREDUCIBLE PARTIALLY ORDERED SETS STEFAN FELSNER
• POSETS AND PLANAR GRAPHS STEFAN FELSNER AND WILLIAM T. TROTTER
• Ubung zur Vorlesung: Felsner/Baier Graphentheorie 5. Februar 2004
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 30. Mai
• Binary Labelings for Plane Quadrangulations and their Stefan Felsner
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• Intersection Graphs of Pseudosegments: Chordal Graphs
• Ubung ``Kombinatorische Algorithmen'' SoSe 2006 Stefan Felsner Aufgaben f ur Di. 9. Mai
• More Bounds for the Dimension of Interval Orders S. Felsner 1 and M. Morvan 2
• Ubung zur Vorlesung: Felsner/Baier Graphentheorie 4. Dezember 2003
• Constructing Boundary and Interface Parametrizations for Finite Element Solvers
• 1. Practice sheet for the lecture: Felsner/ Tiwary, Heldt Combinatorics (DS I) 17. April
• Komplement#rpaare linearer Erweiterungen von Ordnungen
• 1. Practice sheet for the lecture: Felsner/ Heldt Combinatorics (DS I) 7. April
• On the Complexity of Partial Order Properties Stefan Felsner Ravi Kant y C.Pandu Rangan z
• Ubung zur Vorlesung: Felsner/Baier Diskrete Strukturen II Graphentheorie 26. Oktober 2005
• Binary Labelings for Plane Quadrangulations and their Stefan Felsner #
• Constructing Colorings for Diagrams \Lambda Stefan Felsner y Jens Gustedt y
• Drawing I (bipolar orientations) Let G = (V; E) be a digraph.
• Faculty of Mathematics University of Barcelona (Spain)
• ON-LINE DIMENSION FOR POSETS EXCLUDING TWO LONG INCOMPARABLE CHAINS
• Embeddings of Planar Graphs. 1 Drawing (I). (Bipolar Orientations). (22-3-2006)
• 5. Practice sheet for the lecture: Felsner/ Heldt, Knauer Combinatorics (DS I) 9. Mai
• Registration (no later than October 15, 2009) Colloquium on Combinatorics 2009
• arXiv:1001.3534v1[math.CO]20Jan2010 Cubic Time Recognition of Cocircuit Graphs of
• Zur Kombinatorik von Pseudohyperebenenarrangements
• Ubung zur Vorlesung: Felsner/Baier Graphentheorie 8. Januar 2004
• Chordal Graphs as Intersection Graphs of Pseudosegments
• Convex Drawings of 3-Connected Plane Graphs Nicolas Bonichon1
• Discrete Structures I Combinatorics Lectures by Prof. Dr. Stefan Felsner
• On the Fractional Dimension of Partially Ordered Sets
• Erfahrungsbericht Kai-Simon Goetzmann
• Technische Universitat Berlin Graphentheorie (DS II) Institut fur Mathematik Wintersemester 2007/2008
• 6. Ubung zur Vorlesung: Ordnungstheorie Felsner 1. Juni 2010
• Trapezoid Graphs and Generalizations, Geometry and Algorithms
• Sorting Using Networks of Stacks and Queues Stefan Felsner
• Technische Universitat Berlin ADM I Graphen und Netzwerkalgorithmen Institut fur Mathematik Sommersemester 2007
• On the Fractional Dimension of Partially Ordered Sets
• Orthogonal Structures in Directed Graphs Stefan Felsner \Lambda
• Zufall und Algorithmen Stefan Felsner
• ON-LINE CHAIN PARTITIONS OF ORDERS: BART LOMIEJ BOSEK, STEFAN FELSNER, KAMIL KLOCH, TOMASZ KRAWCZYK,
• KOLLOQUIUM UBER KOMBINATORIK 12. UND 13. NOVEMBER 2004 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• Projektdarstellung Graphenorientierungen in Ebene und Raum
• 8. Ubungszettel fur die Vorlesung: Felsner, Heldt Vorlesung uber Graphentheorie (DS II) 16. Dezember
• Proportional Contact Representations of Planar Graphs Md. J. Alam1
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• Discrete Structures I Combinatorics Lectures by Prof. Dr. Stefan Felsner
• Prof. Dr. Stefan Felsner Institut fur Mathematik
• Computing Cartograms with Optimal Complexity Md. Jawaherul Alam
• Linear-Time Algorithms for Rectilinear Hole-free Proportional Contact Representations
• 5. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 10. November
• 2. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 20. Oktober
• Rainbow numbers and minimum rainbow subgraphs Ingo Schiermeyer
• 7. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 23. November
• 6. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 17. November
• KOLLOQUIUM UBER KOMBINATORIK --11. UND 12. NOVEMBER 2011
• 4. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 2. November
• KOLLOQUIUM UBER KOMBINATORIK 11. UND 12. NOVEMBER 2011 OTTO-VON-GUERICKE-UNIVERSIT AT MAGDEBURG
• 3. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 27. Oktober
• 12. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 12. January
• Abschlubericht Durham University
• Ich studiere zurzeit mittels eines Erasmus-Stipendiums an der Durham University in England Mathematik. Im Folgenden berichte ich ber meine
• News about Semiantichains and Unichain Bartlomiej Bosek1
• 14. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 26. January
• 10. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 16. December
• The graphs that can be drawn with one bend Stefan Felsner
• 13. Practice sheet for the lecture: Felsner, Heldt Vorlesung uber Graphentheorie/ Graphtheory (DS II) 19. January
• Zwischenbericht Durham University