Personal profile
In Korean
시거스 마크 할버 교수(자연과학대학 수학과)
Education
o (2005) Ph. D, Emory University, Atlanta, Canada
o (2000) B.S. Hon. Simon Fraser University. Vancouver, Canada
o (2000) B.S. Hon. Simon Fraser University. Vancouver, Canada
Professional Experience
o (2009~Present) Professor, Kyungpook National University, Daegu
o (2007~2009 ) NSERC Postdoctoral Fellow, Simon Fraser University, Canada
o (2006~2007) Postdoctoral Researcher, Charles University, Czech Republic
o (2006) Postdoc, University of Victoria, Canada
o (2005~2006) Postdoctoral Researcher, Thompson Rivers University, Canada
o (2007~2009 ) NSERC Postdoctoral Fellow, Simon Fraser University, Canada
o (2006~2007) Postdoctoral Researcher, Charles University, Czech Republic
o (2006) Postdoc, University of Victoria, Canada
o (2005~2006) Postdoctoral Researcher, Thompson Rivers University, Canada
Research Interests
Graph theory, Graph homomorphisms, Constraint Satisfaction problems, Combinatorial Reconfiguration
url
Fingerprint
Dive into the research topics where Mark Siggers is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Reconfiguring homomorphisms to reflexive graphs via a simple reduction
Mühlenthaler, M., Siggers, M. & Suzan, T., Feb 2026, In: European Journal of Combinatorics. 132, 104251.Research output: Contribution to journal › Article › peer-review
-
On geometric realizations of the extreme Khovanov homology of pretzel links
Oh, J., Siggers, M. H., Yang, S. Y. & Yun, H., 1 Oct 2025, In: Topology and its Applications. 371, 109360.Research output: Contribution to journal › Article › peer-review
-
The Complexity of Adaptably k-Colouring Edge-Coloured Hypergraphs
Kim, H. & Siggers, M., 2025, In: Kyungpook Mathematical Journal. 65, 2, p. 195-206 12 p.Research output: Contribution to journal › Article › peer-review
-
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the “H”-Graphs
Lozin, V., Martin, B., Pandey, S., Paulusma, D., Siggers, M., Smith, S. & van Leeuwen, E. J., 4 Dec 2024, 35th International Symposium on Algorithms and Computation, ISAAC 2024. Mestre, J. & Wirth, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 322).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2 Scopus citations -
Mixing is hard for triangle-free reflexive graphs
Kim, H., Lee, J. B. & Siggers, M., Feb 2024, In: European Journal of Combinatorics. 116, 103860.Research output: Contribution to journal › Article › peer-review
Open Access1 Scopus citations