Desktop-Bild

Dr. rer. nat. Robert Scheidweiler

Contact / Curriculum Vitae / Research / Publications / Projects / Talks / Teaching


Given talks

[2016] [2015] [2014] [2013] [2012] [2011] [2010]
2016
Matchings, Colorings, and Reconstruction
Matchings, Colorings, and Reconstruction

abstract
ABC-Workshop, Gut Vorwald, Schmallenberg, Germany. (02/08/2016)
Generating Pruning Rules For Enumerative Equitable Coloring Algorithms
Generating Pruning Rules For Enumerative Equitable Coloring Algorithms

abstract
Zuse Institute Berlin, Berlin, Germany. (21/03/2016)

2015
Reconstructing Subsets of the Plane up to some Groups of Isometries
Reconstructing Subsets of the Plane up to some Groups of Isometries

abstract
Optimization, Geometry and Discrete Mathematics Group Seminar (invited presentation), University of Cologne, Cologne, Germany. (25/11/2015)
Matchings, Factors, and Vertex Covers in Balanced Hypergraphs
Matchings, Factors, and Vertex Covers in Balanced Hypergraphs

abstract
OR Group Seminar (invited presentation), Maastricht University, Maastricht, The Netherlands. (18/11/2015)
Ehrhart polynomials and the Erdös Multiplication Table Problem
Ehrhart polynomials and the Erdös Multiplication Table Problem

abstract
25th British Combinatorial Conference, University of Warwick, Coventry, England, UK. (09/07/2015)
Ehrhart polynomials and the Erdös Multiplication Table Problem
Ehrhart polynomials and the Erdös Multiplication Table Problem

abstract
Fifth International Conference on Combinatorics, Graph Theory, and Applications, Elgersburg, Germany. (16/03/2015)

2014
The duality between matchings and vertex covers in balanced hypergraphs
The duality between matchings and vertex covers in balanced hypergraphs

abstract
Bordeaux Graph Workshop, Bordeaux, France. (21/11/2014)
On the duality between matchings and vertex covers in balanced hypergraphs
On the duality between matchings and vertex covers in balanced hypergraphs

abstract
23rd Workshop on Cycles and Colourings, Novy Smokovec, High Tatras, Slovakia. (08/09/2014)
The Duality between Matchings and Vertex Covers in Balanced Hypergraphs
The Duality between Matchings and Vertex Covers in Balanced Hypergraphs

abstract
OR 2014, RWTH Aachen University, Aachen, Germany. (05/09/2014)

2013
Reconstructing finite subsets of the plane up to some groups of isometries
Reconstructing finite subsets of the plane up to some groups of isometries

abstract
22nd Workshop '3in1', Lgota Murowana, Kroczyce, Poland. (30/11/2013)
New estimates for the gap chromatic number
New estimates for the gap chromatic number

abstract
22nd Workshop on Cycles and Colourings, Novy Smokovec, High Tatras, Slovakia. (09/09/2013)
Grundlagen der Graphentheorie - eulersche Graphen und Färbungen
Grundlagen der Graphentheorie - eulersche Graphen und Färbungen

abstract
Mathe-Leistungscamp, Kronenburg, Eifel, Germany. (10/07/2013)
Workshop Statistik - Einführung in die angewandte Statistik
Workshop Statistik - Einführung in die angewandte Statistik

abstract
Pfeifer & Langen GmbH & Co. KG, Elsdorf, Rheinland, Germany. (29/04/2013)
An upper bound for the gap chromatic number
An upper bound for the gap chromatic number

abstract
44th Southeastern International Conference on Combinatorics, Graph Theory & Computing, Florida Atlantic University, Boca Raton, Florida, USA. (05/03/2013)

2012
Diskrete Mathematik zum Anfassen
Diskrete Mathematik zum Anfassen

abstract
Gemeinschaftshauptschule Drimborn, Aachen, Germany. (19/12/2012)
Gap colorings inducing proper vertex colorings
Gap colorings inducing proper vertex colorings

abstract
International Symposium on Combinatorial Optimization 2012, Saïd Business School, University of Oxford, Oxford, UK. (17/09/2012)
Neighbour distinguishing gap colourings
Neighbour distinguishing gap colourings

abstract
21st Workshop on Cycles and Colourings, Novy Smokovec, High Tatras, Slovakia. (13/09/2012)
Mathematik mit Ecken und Kanten
Mathematik mit Ecken und Kanten

abstract
Mint Mathe Camp, RWTH Aachen University, Aachen, Germany. (06/09/2012)
Vertex Coloring by means of gap colorings - are there easier approaches?
Vertex Coloring by means of gap colorings - are there easier approaches?

abstract
Group seminar, RWTH Aachen University, Aachen, Germany. (02/07/2012)
Grundlagen der Graphentheorie - eulersche Graphen und Färbungen
Grundlagen der Graphentheorie - eulersche Graphen und Färbungen

abstract
Mathe-Leistungscamp, Kronenburg, Eifel, Germany. (28/06/2012)
New Estimations of the Gap-k-coloring Number
New Estimations of the Gap-k-coloring Number

abstract
11th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Universität der Bundeswehr München, München, Germany. (30/05/2012)

2011
Gap-k-colorings of trees and cycles
Gap-k-colorings of trees and cycles

abstract
20th Workshop on Cycles and Colourings, Novy Smokovec, High Tatras, Slovakia. (06/09/2011)
Some new estimations of the gap-k-coloring number
Some new estimations of the gap-k-coloring number

abstract
Group seminar, RWTH Aachen University, Aachen, Germany. (01/09/2011)
Matchings in balanced hypergraphs
Matchings in balanced hypergraphs

abstract
10th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Villa Mondragone, Frascati, Italy. (16/06/2011)

2010
Matchings in balanced hypergraphs
Matchings in balanced hypergraphs

abstract
19th Workshop on Cycles and Colourings, Tatranska Strba, High Tatras, Slovakia. (07/09/2010)

last modified: 23/08/2016 - 11:19