| 2008 |
|---|
| 20 | EE | Pierre Kelsen,
Qin Ma:
A Lightweight Approach for Defining the Formal Semantics of a Modeling Language.
MoDELS 2008: 690-704 |
| 19 | EE | Pierre Kelsen,
Elke Pulvermueller,
Christian Glodt:
Specifying Executable Platform-Independent Models using OCL.
ECEASST 9: (2008) |
| 2007 |
|---|
| 18 | EE | Christian Glodt,
Pierre Kelsen,
Elke Pulvermueller:
DEMOCLES: a tool for executable modeling of platform-independent systems.
OOPSLA Companion 2007: 870-871 |
| 2006 |
|---|
| 17 | | Pierre Kelsen:
A declarative executable model for object-based systems based on functional decomposition.
ICSOFT (1) 2006: 63-71 |
| 16 | EE | Christian Glodt,
Pierre Kelsen:
DEMOS: a tool for declarative executable modeling of object-based systems.
OOPSLA Companion 2006: 716-717 |
| 2004 |
|---|
| 15 | EE | Pierre Kelsen:
A Simple Static Model for Understanding the Dynamic Behavior of Programs.
IWPC 2004: 46-51 |
| 2003 |
|---|
| 14 | EE | Pierre Kelsen:
An Information-Based View of Representational Coupling in Object-Oriented Systems.
FASE 2003: 216-230 |
| 1996 |
|---|
| 13 | | Pierre Kelsen:
Ranking and Unranking Trees Using Regular Reductions.
STACS 1996: 581-592 |
| 12 | | Pierre Kelsen:
Neighborhood Graphs and Distributed Delta+1-Coloring.
SWAT 1996: 223-233 |
| 11 | | Pierre Kelsen,
Sanjeev Mahajan,
Ramesh Hariharan:
Approximate Hypergraph Coloring.
SWAT 1996: 41-52 |
| 10 | EE | Oscar Garrido,
Pierre Kelsen,
Andrzej Lingas:
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity.
Inf. Process. Lett. 58(2): 55-58 (1996) |
| 9 | | Noga Alon,
Pierre Kelsen,
Sanjeev Mahajan,
Ramesh Hariharan:
Approximate Hypergraph Coloring.
Nord. J. Comput. 3(4): 425-439 (1996) |
| 1995 |
|---|
| 8 | | Pierre Kelsen,
Vijaya Ramachandran:
On Finding Minimal Two-Connected Subgraphs.
J. Algorithms 18(1): 1-49 (1995) |
| 7 | | Xiaofeng Han,
Pierre Kelsen,
Vijaya Ramachandran,
Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time.
SIAM J. Comput. 24(6): 1332-1358 (1995) |
| 1994 |
|---|
| 6 | | Pierre Kelsen:
An Optimal Parallel Algorithm for Maximal Matching.
Inf. Process. Lett. 52(4): 223-228 (1994) |
| 1993 |
|---|
| 5 | EE | Pierre Kelsen:
Fast Parallel Matching in Expander Graphs.
SPAA 1993: 293-299 |
| 1992 |
|---|
| 4 | EE | Xiaofeng Han,
Pierre Kelsen,
Vijaya Ramachandran,
Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time.
SODA 1992: 146-156 |
| 3 | | Pierre Kelsen:
On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph
STOC 1992: 339-350 |
| 2 | | Elias Dahlhaus,
Marek Karpinski,
Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Inf. Process. Lett. 42(6): 309-313 (1992) |
| 1991 |
|---|
| 1 | | Pierre Kelsen,
Vijaya Ramachandran:
On Finding Minimal 2-Connected Subgraphs.
SODA 1991: 178-187 |
