Anders Sune Pedersen, Cand.Scient., Ph.D. (SDU, 24th of January 2011)
Contact information:
Email:
asp@imada.sdu.dk
I shall be (have been) attending the following events:
Algebraic Graph Theory Summer School 2011, Rogla, Slovenia USCS 2011: Applied Functional Programming Kolloquium über Kombinatorik, 11.-12. November 2011, Otto-von-Guericke-Universität, MagdeburgErdös lap number: At Prague Midsummer Combinatorial Workshop XV I attained Erdös lap number 3.
Research interest: Graph Theory and Combinatorics
Mathematical publications (pdf, ps)
Professional activities:
Reviewer for
Referee for
Applied Mathematics
Ars Combinatoria
Australasian Journal of Combinatorics
Discrete Applied Mathematics
Discrete Mathematics
Discrete Mathematics and Theoretical Computer Science
Discussiones Mathematicae
Electronic Journal of Combinatorics
Information Processing Letters
ISAAC -- International Symposium on Algorithms and Computation
LAGOS -- Latin-American Algorithms, Graphs and Optimization Symposium
Opuscula Mathematica
L. D. Andersen, J. Bang-Jensen, J. Bárat, M. Chiarandini, T. R. Jensen, L. K. Jørgensen, M. Kriesell, A. S. Pedersen, B. Toft (Eds.) (2010). Special issue dedicated to Carsten Thomassen on his 60th birthday, vol. 310 of Discrete Mathematics. [ DOI ]
Technical reports, preprints, manuscripts, etc.:
Contributions to the Theory of Colourings, Graph Minors, and Independent Sets PhD thesis, November, 2010.
On computational complexity and Gallai-type theorems involving graph domination parameters, preprints 2008 No 10, IMADA, SDU.
On certain graph isomorphisms. Ongoing project with Martin Milanic and Daniel Pellicer.
On graphs double-critical with respect to the colouring number, with Matthias Kriesell, arXiv:1108.1036, submitted.
Hadwiger's Conjecture and inflations of the Petersen graph, preprint 2011 No 2, IMADA, SDU, submitted.
The Erdos-Lovasz Tihany Conjecture and complete minors, with Ken-ichi Kawarabayashi and Bjarne Toft, 2011, submitted.
Miscellaneous notes and presentations:
Graffarvning, dobbelt-kritiske grafer og Hadwigers formodning Slides fra rundstykkeseminar 05.05.09
Double-critical graphs A few slides on double-critical graphs
Notes on the Probabilistic Method
Notes on Mader's S-path Theorem
A correctness proof of the Knuth-Morris-Pratt string-matching algorithm This note might be useful for students following DM508.
Other links :
Liv
Thriller
Apache
Hammerslag
Didaktik I
Ude på noget
Snorkel og Gummitær
Mathematics
LaTeX
Volvo
Dänemark
Birthe forever
Spademanns guide til at blive en diktator
Samtalekøkner
Kultur
Mindernes cafe
The joys of Mathematics
Egmont Rollators - my former FC in Aarhus
Hip Hurra
Dekomüllt
Kandis
Ode to the internet by Erwin Neutzsky-Wulff
Paradis melder alt udsolgt
Nørder
Sol og Sommer
Linux
Havenisserne og efteraar
Tulip Reklame Bjoern
teaching math
Laban
OLs ceremoniarrangør svarer på kritik
Hoppegyngen
F.O.G.G.
Nytaarstalen
Klaus
Skateboarding
Sokal affair
Rejecta Mathematica
the internet (1993)
Linux 1.0
Havenisserne og Championsleague