Home
Research
Teaching
Equations
CV
NVC
Contact
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

 

  

Publications

 

 

 

   Colorings and Orientations of Matrices and Graphs

      The Electronic Journal of Combinatorics 13 (2006), #R61, p. 1-12

      http://www.combinatorics.org/Volume_13/PDF/v13i1r61.pdf

   Doctoral Thesis: Algebraically Solvable Problems

      http://tobias-lib.ub.uni-tuebingen.de/volltexte/2007/2955

   Describing Polynomials as Equivalent to Explicit Solutions

      The Electronic Journal of Combinatorics 15 (2008), #R10, p 1-35

      http://www.combinatorics.org/Volume_15/PDF/v15i1r10.pdf

   On the Dispersions of the Polynomial Maps over Finite Fields

      The Electronic Journal of Combinatorics 15 (2008), #R145, p. 1-16

      http://www.combinatorics.org/Volume_15/PDF/v15i1r145.pdf

   Mr. Paint and Mrs. Correct

      The Electronic Journal of Combinatorics 16/1 (2009), #R77, p. 1-18

      http://www.combinatorics.org/Volume_16/PDF/v16i1r77.pdf

   Flexible Color Lists in Alon and Tarsi's Theorem,

   and Time Scheduling with Unreliable Participants

      The Electronic Journal of Combinatorics 17/1 (2010), #R13, p. 1-18

      http://www.combinatorics.org/Volume_17/PDF/v17i1r13.pdf

   Brooks’ Theorem via the Alon–Tarsi Theorem

      With Jan Hladký and Daniel Kráľ.

      Discrete Mathematics 310, Issue 23 (2010), p. 3426–3428

   A Paintability Version of the Combinatorial Nullstellensatz,

   and List Colorings of k-partite k-uniform Hypergraphs

      The Electronic Journal of Combinatorics 17/1 (2010), #R176, p. 1-13

      http://www.combinatorics.org/Volume_17/PDF/v17i1r176.pdf

   Colorings and Nowhere Zero Flows of Graphs in Terms of Berlekamp's Switching Game

      The Electronic Journal of Combinatorics 18/1 (2011), #P65, p. 1-33

      http://www.combinatorics.org/Volume_18/PDF/v18i1p65.pdf

   Anti-Codes in Terms of Berlekamp's Switching Game

      The Electronic Journal of Combinatorics 19/1 (2012), #P10, p. 1-16a

        http://new.combinatorics.org/ojs/index.php/eljc/article/view/v19i1p10/pdf

   Critically Paintable, Choosable or Colorable Graphs

      With Ayesha Riasat, submitted

   Improved Multidimensional Parity Check and Berlekamp Codes

      In preparation

 

  

 

 

 

 

Talks

 

 


    11/2007

          Talk in Magdeburg

    01/2008

          Talk at the annual AMS-Meeting in San Diego

    01/2008

          Seminar talks at CSUSM, UCSD and Caltech in California

    04/2008 – 08/2008

          Three talks at Universities in Berlin

    01/2009 – 06/2011

          Eight talks at KFUPM in Dhahran

    07/2009

          Talk at the British Combinatorial Conference in St Andrews


    11/2009

          Seminar talks at PNU, POSTECH and KAIST in Korea


    04/2010

          Talk at ALCOMA 2010 in Thurnau


    11/2010

          Lectures at a school in Pokhara, Nepal


    07/2011

          Talk at the BCC 23 in Exeter


    07/2011

          Talk at the Fq 10 in Ghent


    09/2011 – 01/2012

          Four talks at Universities in Lahore, Pakistan