International Symposium on Parameterized and Exact Computation

International Symposium on Parameterized and Exact Computation
Name	International Symposium on Parameterized and Exact Computation
Abbreviation	IPEC
Discipline	Theoretical computer science
First	2004
Frequency	Annual
Country	International

International Symposium on Parameterized and Exact Computation is an annual academic conference focusing on parameterized complexity and exact algorithms, attracting researchers from theoretical computer science, mathematics, and combinatorics. The symposium provides a forum where advances in algorithm design, complexity theory, and combinatorial optimization are presented alongside connections to graph theory, logic, and approximation. Leading institutions, funding agencies, and professional societies collaborate to host the meeting, which often precedes or follows other conferences in the algorithmic community.

History

The symposium was founded in the early 2000s amid growing interest in fixed-parameter tractability and exact exponential-time algorithms, influenced by pioneering work from researchers associated with École Polytechnique, University of Szeged, University of Warwick, University of Bonn, and University of Edinburgh. Early iterations built on foundations laid by conferences such as STOC, FOCS, ICALP, ESA and workshops linked to Dagstuhl Seminars, and incorporated program committee members from Max Planck Institute for Informatics, CNRS, University of Cambridge, Princeton University, and ETH Zurich. Over time the symposium has rotated venues through Europe, North America, and Asia, drawing program chairs from Massachusetts Institute of Technology, University of California, Berkeley, Seoul National University, University of Tokyo, and Indian Institute of Science.

Scope and Topics

IPEC covers a spectrum of topics including fixed-parameter algorithms, kernelization, exact exponential-time algorithms, parameterized counting, and parameterized approximation, as studied by researchers from Carnegie Mellon University, Stanford University, University of Oxford, University of Toronto, and University College London. The program typically features submissions on parameterized complexity classes such as those introduced in work by scholars affiliated with Princeton University, Hebrew University of Jerusalem, Rutgers University, University of California, San Diego, and Tel Aviv University, as well as applications to graph algorithms, satisfiability, constraint satisfaction problems, and logic, connecting to research at Bell Labs, Microsoft Research, Google Research, IBM Research, and Facebook AI Research. Topics also interact with parameterized aspects of problems studied in SIAM, ACM, IEEE Computer Society, EATCS, and other professional bodies.

Conference Organization and Format

Organization is overseen by appointed general chairs and program committees drawn from University of Cambridge, University of Oxford, Cornell University, ETH Zurich, and University of Melbourne, often coordinating with local organizing committees at host institutions like Technical University of Munich or Nanyang Technological University. The typical format includes peer-reviewed paper presentations, invited talks by leaders from University of California, Los Angeles, Columbia University, Imperial College London, Peking University, and National University of Singapore, poster sessions, and panels with editors from journals such as Journal of the ACM, SIAM Journal on Computing, Algorithmica, Theoretical Computer Science, and ACM Transactions on Algorithms. Workshops and satellite events are commonly co-located with meetings like SODA, WABI, ALENEX, MFCS, and ISAAC.

Proceedings and Publication

Accepted papers are published in proceedings managed by series linked to Springer, Lecture Notes in Computer Science, and occasionally in special issues of venues including Algorithmica, Journal of Computer and System Sciences, ACM Transactions on Algorithms, SIAM Journal on Discrete Mathematics, and edited volumes produced by editors from Cambridge University Press or Oxford University Press. The review process is double-blind or single-blind depending on the year and is coordinated through submission systems used by EasyChair, HotCRP, and institutional repositories at universities such as Harvard University and Yale University. Preprints by authors often appear on arXiv and are discussed at reading groups affiliated with departments at Princeton University, University of Illinois Urbana–Champaign, University of Washington, and Boston University.

Awards and Recognitions

The symposium recognizes outstanding contributions through awards named or supported by academic groups and sponsors from Microsoft Research, Google Research, NSF, European Research Council, and industrial partners, and sometimes best paper or best student paper distinctions judged by panels including scholars from Brown University, Duke University, Johns Hopkins University, Northwestern University, and University of Pennsylvania. Invited lectures may honor seminal contributions by researchers associated with ETH Zurich, EPFL, University of Amsterdam, KTH Royal Institute of Technology, and University of Helsinki, and emeritus figures who have influenced parameterized complexity and exact computation.

Notable Results and Contributions

Over its history the symposium has showcased kernelization lower bounds, meta-theorems for fixed-parameter tractability, improved exact exponential-time algorithms, and complexity separations that have been influential in work at University of Chicago, University of Waterloo, McGill University, University of British Columbia, and Simon Fraser University. Breakthroughs presented at the meeting have linked to major developments in graph minors theory by researchers connected to Princeton University and Rutgers University, parameterized counting analogues tied to specialists at University of Cambridge and University of Oxford, and refined branching techniques related to contributions from University of California, Santa Barbara and University of Maryland. Results from the symposium have been cited in algorithmic studies involving approximation schemes, constraint satisfaction, and satisfiability research undertaken at Cornell University, University of Pennsylvania, Stony Brook University, Indiana University Bloomington, and Arizona State University, influencing subsequent work across the theoretical computer science community.

Category:Theoretical computer science conferences