Paul Molitor

	2009
43		Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor: Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. AAIM 2009: 175-187
42		Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor: Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. CTW 2009: 3-6
	2008
41		Gerold Jäger, Paul Molitor: Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA 2008: 211-224
40		Paul Molitor: Gutachter 2008. it - Information Technology 50(6): 410 (2008)
	2007
39		Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor: Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN 2007: 99-111
38		Changxing Dong, Paul Molitor: What Graphs can be Efficiently Represented by BDDs? ICCTA 2007: 128-134
	2006
37		Boris Goldengorin, Gerold Jäger, Paul Molitor: Some Basics on Tolerances. AAIM 2006: 194-206
36		Boris Goldengorin, Gerold Jäger, Paul Molitor: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97
35		Paul Molitor: ...was wird mit übrigens? it - Information Technology 48(4): 247 (2006)
	2005
34		Paul Molitor: Gutachter 2005. it - Information Technology 47(6): 366- (2005)
	2004
33		Paul Molitor: Gutachter 2004. it - Information Technology 46(6): 360- (2004)
	2003
32		Martin Keim, Rolf Drechsler, Bernd Becker, Michael Martin, Paul Molitor: Polynomial Formal Verification of Multipliers. Formal Methods in System Design 22(1): 39-58 (2003)
31		Heinz Zemanek, Johannes Oldenbourg, Paul Molitor, Klaus Küspert, Kurt Rothermel: Zum neuen Jahrgang. it - Information Technology 45(1): 3-5 (2003)
	2002
30		Robby Schönfeld, Paul Molitor: What are the samples for learning efficient routing heuristics? [MCM routing]. APCCAS (1) 2002: 267-272
29		Janett Mohnke, Paul Molitor, Sharad Malik: Limits of Using Signatures for Permutation Independent Boolean Comparison. Formal Methods in System Design 21(2): 167-191 (2002)
	2001
28		Jörg Ritter, Paul Molitor: A pipelined architecture for partitioned DWT based lossy image compression using FPGA's. FPGA 2001: 201-206
27		Janett Mohnke, Paul Molitor, Sharad Malik: Application of BDDs in Boolean matching techniques for formal logic combinational verification. STTT 3(2): 207-216 (2001)
	2000
26		Sandro Wefel, Paul Molitor: Prove that a faulty multiplier is faulty!? ACM Great Lakes Symposium on VLSI 2000: 43-46
25		Riccardo Forth, Paul Molitor: An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines. ASP-DAC 2000: 61-66
24		Wolfgang Günther, Robby Schönfeld, Bernd Becker, Paul Molitor: k-Layer Straightline Crossing Minimization by Speeding Up Sifting. Graph Drawing 2000: 253-258
23		Laura Heinrich-Litan, Paul Molitor: Least Upper Bounds for the Size of OBDDs Using Symmetry Properties. IEEE Trans. Computers 49(4): 360-368 (2000)
	1999
22		Christian Matuszewski, Robby Schönfeld, Paul Molitor: Using Sifting for k -Layer Straightline Crossing Minimization. Graph Drawing 1999: 217-224
21		Christoph Scholl, Dirk Möller, Paul Molitor, Rolf Drechsler: BDD minimization using symmetries. IEEE Trans. on CAD of Integrated Circuits and Systems 18(2): 81-100 (1999)
20		Janett Mohnke, Paul Molitor, Sharad Malik: Establishing latch correspondence for sequential circuits using distinguishing signatures. Integration 27(1): 33-46 (1999)
	1998
19		Laura Heinrich-Litan, Ursula Fissgus, St. Sutter, Paul Molitor, Thomas Rauber: Modeling the Communication Behavior of Distributed Memory Machines by Genetic Programming. Euro-Par 1998: 273-278
	1997
18		Christoph Scholl, S. Melchior, Günter Hotz, Paul Molitor: Minimizing ROBDD sizes of incompletely specified Boolean functionsby exploiting strong symmetries. ED&TC 1997: 229-234
17		Martin Keim, Michael Martin, Bernd Becker, Rolf Drechsler, Paul Molitor: Polynomial Formal Verification of Multipliers. VTS 1997: 150-157
	1996
16		Laura Heinrich-Litan, Paul Molitor, Dirk Möller: Least Upper Bounds on the Sizes of Symmetric Variable Order based OBDDs. Great Lakes Symposium on VLSI 1996: 126-
15		Tolga Asveren, Paul Molitor: New Crossover Methods For Sequencing Problems. PPSN 1996: 290-299
	1995
14		Christoph Scholl, Paul Molitor: Communication based FPGA synthesis for multi-output Boolean functions. ASP-DAC 1995
13		Janett Mohnke, Paul Molitor, Sharad Malik: Limits of using signatures for permutation independent Boolean comparison. ASP-DAC 1995
12		Ines Peters, Paul Molitor: Priority driven channel pin assignment. Great Lakes Symposium on VLSI 1995: 132-
11		Bernd Becker, Rolf Drechsler, Paul Molitor: On the generation of area-time optimal testable adders. IEEE Trans. on CAD of Integrated Circuits and Systems 14(9): 1049-1066 (1995)
	1994
10		Paul Molitor, Uwe Sparmann, Dorothea Wagner: Two-Layer Wiring with Pin Preassignments is Easier if the Power Supply Nets are Already Generated. VLSI Design 1994: 149-154
	1992
9		Michael Kaufmann, Paul Molitor, Wolfgang Vogelgesang: Performance Driven k-Layer Wiring. STACS 1992: 489-500
	1991
8		Paul Molitor: A Survey on Wiring. Elektronische Informationsverarbeitung und Kybernetik 27(1): 3-19 (1991)
	1990
7		Bernd Becker, Thomas Burch, Günter Hotz, D. Kiel, Reiner Kolla, Paul Molitor, Hans-Georg Osthof, Gisela Pitsch, Uwe Sparmann: A graphical system for hierarchical specifications and checkups of VLSI circuits. EURO-DAC 1990: 174-179
6		Paul Molitor: Constrained via minimization for systolic arrays. IEEE Trans. on CAD of Integrated Circuits and Systems 9(5): 537-542 (1990)
	1987
5		Bernd Becker, Günter Hotz, Reiner Kolla, Paul Molitor, Hans-Georg Osthof: Hierarchical Design Based on a Calculus of Nets. DAC 1987: 649-653
4		Paul Molitor: On the Contact-Minimization-Problem. STACS 1987: 420-431
	1986
3		Günter Hotz, Reiner Kolla, Paul Molitor: On Network Algebras and Recursive Equations. Graph-Grammars and Their Application to Computer Science 1986: 250-261
2		Günter Hotz, Bernd Becker, Reiner Kolla, Paul Molitor: Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil I. Inform., Forsch. Entwickl. 1(1): 38-47 (1986)
1		Günter Hotz, Bernd Becker, Reiner Kolla, Paul Molitor: Ein logisch-topologischer Kalkül zur Konstruktion integrierter Schaltkreise, Teil II. Inform., Forsch. Entwickl. 1(2): 72-82 (1986)

Coauthor Index

1	Tolga Asveren	[15]
2	Bernd Becker	[1] [2] [5] [7] [11] [17] [24] [32]
3	Thomas Burch	[7]
4	Changxing Dong	[38] [42] [43]
5	Rolf Drechsler	[11] [17] [21] [32]
6	Christian Ernst	[42]
7	Ursula Fissgus	[19]
8	Riccardo Forth	[25]
9	Boris Goldengorin	[36] [37] [39]
10	Wolfgang Günther	[24]
11	Laura Heinrich-Litan	[16] [19] [23]
12	Günter Hotz	[1] [2] [3] [5] [7] [18]
13	Gerold Jäger	[36] [37] [39] [41] [42] [43]
14	Michael Kaufmann	[9]
15	Martin Keim	[17] [32]
16	D. Kiel	[7]
17	Reiner Kolla	[1] [2] [3] [5] [7]
18	Klaus Küspert	[31]
19	Sharad Malik	[13] [20] [27] [29]
20	Michael Martin	[17] [32]
21	Christian Matuszewski	[22]
22	S. Melchior	[18]
23	Janett Mohnke	[13] [20] [27] [29]
24	Dirk Möller	[16] [21]
25	Johannes Oldenbourg	[31]
26	Hans-Georg Osthof	[5] [7]
27	Ines Peters	[12]
28	Gisela Pitsch	[7]
29	Thomas Rauber	[19]
30	Dirk Richter	[39] [42] [43]
31	Jörg Ritter	[28]
32	Kurt Rothermel	[31]
33	Christoph Scholl	[14] [18] [21]
34	Robby Schönfeld	[22] [24] [30]
35	Uwe Sparmann	[7] [10]
36	St. Sutter	[19]
37	Wolfgang Vogelgesang	[9]
38	Dorothea Wagner	[10]
39	Sandro Wefel	[26]
40	Heinz Zemanek	[31]

Colors in the list of coauthors