Professor at UL since 2000, Computer Science and Communication Group
Post-Doctoral Fellow, University of British Columbia, Vancouver, Canada and Max-Planck-Institut für Informatik, Saarbrücken, Germany.
Ph.D. in Computer Science from University of Illinois at Urbana-Champaign in 1993 (advisor: Prof. Vijaya Ramachandran)
M.Sc. in Computer Science from University of Illinois at Urbana-Champaign in 1989
Diploma in Computer Science from University of Karlsruhe in 1986
Study Director of the Master in Information and Computer Sciences (mics.uni.lu) since 2009
Head of the Laboratory for Advanced Software Systems within the Computer Science and Communications Research Unit
Software Complexity, Model-Driven Engineering, Formal Methods; Algorithms and Complexity; Combinatorial Methods; Algorithmic Graph Theory
ASINE (2013 – present):
Funding Source: FNR Pearl
Title: Architecture-based Service Innovation in Networked Enterprises (ASINE) (together with CRP Henri Tudor)
MaRCo (2010 – 2013):
Funding Source: FNR Core
Title: Managing Regulatory Compliance: a Business-Centred Approach
See ORBi for a more complete list.
Marwane El Kharbili, Qin Ma, Pierre Kelsen, Elke Pulvermueller: CoReL: Policy-Based and Model-Driven Regulatory Compliance Management. EDOC 2011: 247-256
Pierre Kelsen, Qin Ma, Christian Glodt: Models within Models: Taming Model Complexity Using the Sub-model Lattice. FASE 2011: 171-185
Nuno Amálio, Pierre Kelsen, Qin Ma, Christian Glodt: Using VCL as an Aspect-Oriented Approach to Requirements Modelling. T. Aspect-Oriented Software Development 7: 151-199 (2010)
Pierre Kelsen, Qin Ma: A Lightweight Approach for Defining the Formal Semantics of a Modeling Language. MoDELS 2008: 690-704
P. Kelsen, E. Pulvermueller, and C. Glodt. Specifying executable platform-independent models using OCL. ECEASST 2008(9), 2007.
Christian Glodt, Pierre Kelsen, Elke Pulvermueller: DEMOCLES: a tool for executable modeling of platform-independent systems. OOPSLA Companion 2007: 870-871
Pierre Kelsen: A declarative executable model for object-based systems based on functional decomposition.ICSOFT 2006: 63-71
Pierre Kelsen: A Simple Static Model for Understanding the Dynamic Behavior of Programs. IWPC 2004: 46-51
Pierre Kelsen: An Information-Based View of Representational Coupling in Object-Oriented Systems. FASE 2003: 216-230
Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Hariharan Ramesh, Coloring 2-colorable hypergraphs with a sublinear number of colors, Nordic Journal of Computing, Volume 3, Issue 4, 1996, Pages: 425 – 439.
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan: Computing Minimal Spanning Subgraphs in Linear Time. SIAM J. Comput. 24(6): 1332-1358 (1995)
Pierre Kelsen, Vijaya Ramachandran: On Finding Minimal Two-Connected Subgraphs. J. Algorithms 18(1): 1-49 (1995)
Pierre Kelsen: On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph. STOC 1992: 339-350