This shows you the differences between two versions of the page.
people:zaslav:start [2015/10/05 05:10] 127.0.0.1 external edit |
people:zaslav:start [2024/03/28 05:10] (current) |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | /* DEPT_INFO LOGIN=zaslav */ | ||
+ | /* ====================== IMPORTANT ========================= */ | ||
+ | /* The lines between DEPT_INFO above and END_DEPT_INFO below are system */ | ||
+ | /* generated and are updated every night. If you desire to edit them, */ | ||
+ | /* remove the lines with DEPT_INFO and DEPT_INFO_END so that you will not */ | ||
+ | /* lose your editing. */ | ||
+ | |||
+ | ~~NOCACHE~~ | ||
+ | |||
+ | | <WRAP> | ||
+ | {{http://people.math.binghamton.edu/images//faculty/zaslav.jpg?220x260}} | ||
+ | </WRAP> | <WRAP> | ||
+ | <WRAP centeralign> | ||
+ | |||
+ | ===== Thomas Zaslavsky ===== | ||
+ | </WRAP> | ||
+ | Professor \\ | ||
+ | Ph.D., 1974, Massachusetts Institute of Technology \\ | ||
+ | At Binghamton since 1985 \\ | ||
+ | **Areas of Interest:** Combinatorics, graph theory \\ | ||
+ | [[ http://www2.math.binghamton.edu/p/research#zaslav | Summary of research interests ]] \\ | ||
+ | |||
+ | [[ http://www.ams.org/mathscinet/search/publications.html?pg1=IID&s1=186665 | Math Reviews list of published papers ]]. \\ | ||
+ | (Institutional subscription to [[ http://www.ams.org/mathscinet/ | MathSciNet]] is needed for viewing.) \\ | ||
+ | |||
+ | |||
+ | |||
+ | <WRAP> | ||
+ | | **E-mail:** | zaslav@math.binghamton.edu | | ||
+ | | **Fax:** | (607) 777-2450 | | ||
+ | </WRAP> | ||
+ | |||
+ | </WRAP> | | ||
+ | |||
+ | * **Office:** WH 216 | ||
+ | * **Office hours:** <WRAP 30%> | ||
+ | |MWF|3:00 - 5:00| | ||
+ | ||No appointment needed| | ||
+ | </WRAP> | ||
+ | * **Courses:** | ||
+ | * **Spring 2024** \\ \\ <WRAP 85% indent> | ||
+ | | Math 330 | Section 04 :| Number systems | | ||
+ | | |MWF 1:10 - 2:40 | WH-100B | | ||
+ | </WRAP> | ||
+ | * **Ph. D. Students:** | ||
+ | * Nicholas Lacasse, Spring, 2023 \\ **Thesis:** Signed Graphs & Gain Graphs:Packing, Root Systems,Alcoves & Arrangements | ||
+ | * Christopher Eppolito, Summer, 2022 \\ **Thesis:** Matroids: Mystic Monoliths, Meta Missiles, and Myopic Meadows | ||
+ | * Amelia Mattern, Spring, 2020 \\ **Thesis:** Deficiency in Signed Graphs | ||
+ | * Richard Behr, Spring, 2018 \\ **Thesis:** Edge Coloring and Special Edges of Signed Graphs | ||
+ | * Simon Joyce, Fall, 2017 \\ **Thesis:** Interaction Graphs Derived From Activation Functions and Their Application to Gene Regulation | ||
+ | * Alexander Schaefer, Summer, 2017 \\ **Thesis:** Permutable Matchings and Negative Cycle Vectors | ||
+ | * Jackie Kaminski, Summer, 2013 \\ **Thesis:** Classification of Factored Gain-Graphic Hyperplane Arrangements | ||
+ | * Nathan Reff, Spring, 2012 \\ **Thesis:** Gain Graphs, Group-Oriented Hypergraphs, and Matrices | ||
+ | * Lucas Rusnak, Spring, 2010 \\ **Thesis:** Oriented Hypergraphs | ||
+ | * Garry Bowlin, Summer, 2009 \\ **Thesis:** Maximum Frustration of Bipartite Signed Graphs | ||
+ | * Rigoberto Florez, Summer, 2005 \\ **Thesis:** Four Studies in the Geometry of Biased Graphs | ||
+ | * Lori Koban, Summer, 2004 \\ **Thesis:** Two Generalizations of Biased Graph Theory: Circuit Signatures and Modular Triples of Matroids, and Biased Expansions of Biased Graphs | ||
+ | * Steven Tedford, Spring, 2002 \\ **Thesis:** A Characterization of the Mixed Branching Greedoid | ||
+ | * Daniel Slilaty, Summer, 2000 \\ **Thesis:** Orientations of Biased Graphs and Their Matroids | ||
+ | * Steve Pagano, Spring, 1998 \\ **Thesis:** Separability and Representability of Bias Matroids of Signed Graphs | ||
+ | |||
+ | |||
+ | /* END_DEPT_INFO */ | ||
+ | |||
+ | /* ============================================================== */ | ||
+ | /* ========= Start writing your web page below this line ======== */ | ||
+ | |||
+ | ----- | ||
+ | |||
+ | Here's a link to my [[http://people.math.binghamton.edu/zaslav|personal web page]]. | ||
+ | |||