Professor André Kézdy

Department of Mathematics
University of Louisville
Louisville, KY 40292 USA

office  - 
Natural Sciences Building Room 325
email  -
phone - (502) 852-5986

Andre Kezdy 2016  

Ph.D. Mathematics, University of Illinois @ Champaign-Urbana, 1991
B.A.   Mathematics, University of Chicago, 1984

Research interests:
   graph theory, combinatorics, computational complexity, algebraic methods in combinatorics,
   combinatorial algorithms

   Link to mathscinet review of published/reviewed papers (requires access to AMS mathscinet):

Teaching (Fall 2018)
    Math 105: Quantitative Reasoning - QR, Section 50 (online)
    Math 190: PreCalculus - QR, Section 01, MWF 8:00am-9:15am, NS 110
    Math 205: Calculus I - QR, Section 04, MWF 12:30pm-1:45pm, NS 110

    (Spring 2019)
    Math 105: Quantitative Reasoning - QR, Section 50 (online)
    Math 205: Calculus I - QR, Section 03, MWF 11:00am-12:15pm, NS 212C
    Math 387: Discrete Mathematics, Section 01, MWF 9:00am-9:50am, NS 212F

Doctoral students
   Lesley Wiglesworth (Ph.D. May, 2008) topic: unit-bar visibility graphs
   Tim Brauch (Ph.D. May, 2009), topic:  applications of the Combinatorial Nullstellensatz on bipartite graphs
   Adam Jobson (Ph.D. Dec., 2011), topic: avoiding, pretending, and querying: three combinatorial problems
   Chris Caragianis (Ph.D.  Dec. 2012), topic: connected matchings in special families of graphs
   Charlie Suer (Ph.D. Aug. 2015), topic: the PC-tree algorithm, Kuratowski subdivisions, and the torus

Good reading:
   "You and your research", Richard Hamming

Thanks for visiting!   
Kézdy © 2014-6.

a graph movie