Rainer Schrader

58 papers A 2B 1C 6Journal 46Unranked 2

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	A characterization of interval orders with semiorder dimension two. Discret. Appl. Math. Alexander Apke, Rainer Schrader
2021	J	`jnl`	A note on integral generalized flows in directed partial 2-trees. Inf. Process. Lett. Andreas Billstein, Rainer Schrader
2021	J	`jnl`	Cross-series-parallel digraphs. Discret. Appl. Math. Jorin Dornemann, Rainer Schrader
2020	J	`jnl`	A de Bruijn-Erdös Theorem for (q, q-4)-graphs. Discret. Appl. Math. Rainer Schrader, Lukas Stenmans
2020	J	`jnl`	Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
2018	C	`conf`	A Graph-Theoretic Approach to the Train Marshalling Problem. FedCSIS Jens Dörpinghaus, Rainer Schrader
2015	J	`jnl`	Freight car dispatching with generalized flows. Networks Birgit Engels, Rainer Schrader
2015	C	`conf`	On the non-unit count of interval graphs. CTW Alexander Apke, Rainer Schrader
2015	J	`jnl`	On the non-unit count of interval graphs. Discret. Appl. Math. Alexander Apke, Rainer Schrader
2013	J	`jnl`	9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). Discret. Appl. Math. Ulrich Faigle, Rainer Schrader
2013	J	`jnl`	On the separability of graphs. Discret. Math. Oliver Schaudt, Rainer Schrader, Vera Weil
2012	C	`conf`	On the Separability of Graphs. CTW Oliver Schaudt, Rainer Schrader, Vera Weil
2012	—	`conf`	Sentiment Polarity Classification Using Statistical Data Compression Models. ICDM Workshops Dominique Ziegelmayer, Rainer Schrader
2012	J	`jnl`	The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett. Oliver Schaudt, Rainer Schrader
2010	C	`ed.`	9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts CTW Ulrich Faigle, Rainer Schrader, Daniel Herrmann
2010	J	`jnl`	Distance-hereditary digraphs. J. Discrete Algorithms Martin Lätsch, Rainer Schrader
2009	C	`conf`	Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2. CTW Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck
2009	J	`jnl`	Preface on CTW 2006. Math. Methods Oper. Res. Ulrich Faigle, Rainer Schrader, Rüdiger Schultz
2009	J	`jnl`	Semi-preemptive routing on a linear and circular track. Discret. Optim. Dirk Räbiger, Rainer Schrader
2009	J	`jnl`	Small Molecule Subgraph Detector (SMSD) toolkit. J. Cheminformatics Syed Asad Rahman, Matthew Bashton, Gemma L. Holliday, Rainer Schrader, Janet M. Thornton
2008	J	`jnl`	Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis. J. Comput. Biol. Jutta Gebert, Susanne Motameny, Ulrich Faigle, Christian V. Forst, Rainer Schrader
2008	J	`jnl`	Preface for CTW2005 special issue. Discret. Appl. Math. Ulrich Faigle, Bert Randerath, Rainer Schrader
2008	J	`jnl`	Semi-preemptive routing on trees. Discret. Appl. Math. Sven Oliver Krumke, Dirk Räbiger, Rainer Schrader
2006	J	`jnl`	CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data. Bioinform. Lars Kaderali, Thomas Zander, Ulrich Faigle, Jürgen Wolf, Joachim L. Schultze, Rainer Schrader
2005	J	`jnl`	A fractional programming approach to efficient DNA melting temperature calculation. Bioinform. Markus Leber, Lars Kaderali, Alexander Schönhuth, Rainer Schrader
2005	J	`jnl`	Metabolic Network Analysis: Implication And Application. BMC Bioinform. Syed Asad Rahman, Pardha Saradhi Jonnalagadda, Jyothi Padiadpu, Kai Hartmann, Rainer Schrader, Dietmar Schomburg
2005	J	`jnl`	Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC). Bioinform. Syed Asad Rahman, P. Advani, R. Schunk, Rainer Schrader, Dietmar Schomburg
2004	J	`jnl`	Fast and robust registration of PET and MR images of human brain. NeuroImage Jiri Cizek, Karl Herholz, Stefan Vollmar, Rainer Schrader, Johannes Klein, Wolf-Dieter Heiss
2002	C	`conf`	ProClust: improved clustering of protein sequences with an extended graph-based approach. ECCB P. Pipenbacher, Alexander Schliep, Sebastian Schneckener, Alexander Schönhuth, Dietmar Schomburg, Rainer Schrader
2001	J	`jnl`	Clustering protein sequences-structure prediction by transitive homology. Bioinform. Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader
2001	J	`jnl`	Modeling and Solving an Airline Schedule Generation Problem. Ann. Oper. Res. A. Erdmann, Andreas Nolte, A. Noltemeier, Rainer Schrader
2001	J	`jnl`	Simulated Annealing And Graph Colouring. Comb. Probab. Comput. Andreas Nolte, Rainer Schrader
2001	J	`jnl`	Strongly Connected Components can Predict Protein Structure. Electron. Notes Discret. Math. Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader
2000	J	`jnl`	A Note on the Finite Time Behavior of Simulated Annealing. Math. Oper. Res. Andreas Nolte, Rainer Schrader
1999	—	`conf`	Clustering Protein Sequences ? Structure Prediction by Transitive Homology. German Conference on Bioinformatics Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader
1999	J	`jnl`	The setup polytope of Ann. Oper. Res. Rainer Schrader, Georg Wambach
1998	J	`jnl`	Base polytopes of series-parallel posets: Linear description and optimization. Math. Program. Rainer Schrader, Andreas S. Schulz, Georg Wambach
1997	A	`conf`	Coloring in Sublinear Time. ESA Andreas Nolte, Rainer Schrader
1997	J	`jnl`	The Setup Polyhedron of Series-parallel Posets. Discret. Appl. Math. Rainer Schrader, Georg Wambach
1996	A	`conf`	Simulated Annealing and Its Problems to Color Graphs. ESA Andreas Nolte, Rainer Schrader
1996	J	`jnl`	The permutahedron of N-sparse posets. Math. Program. Annelie von Arnim, Rainer Schrader, Yaoguang Wang
1992	J	`jnl`	A greedy reduction algorithm for setup optimization. Discret. Appl. Math. Ulrich Faigle, Rainer Schrader
1992	J	`jnl`	The Communication Complexity of Interval Orders. Discret. Appl. Math. Ulrich Faigle, Rainer Schrader, György Turán
1990	J	`jnl`	Minor characterization of undirected branching greedoids - a short proof. Discret. Math. Oskar Goecke, Rainer Schrader
1990	J	`jnl`	The permutahedron of series-parallel posets. Discret. Appl. Math. Annelie von Arnim, Ulrich Faigle, Rainer Schrader
1988	J	`jnl`	On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. Ulrich Faigle, Rainer Schrader
1988	J	`jnl`	Simulted Annealing -Eine Fallstudie. Angew. Inform. Ulrich Faigle, Rainer Schrader
1987	J	`jnl`	Interval orders without odd crowns are defect optimal. Computing Ulrich Faigle, Rainer Schrader
1986	J	`jnl`	A combinatorial bijection between linear extensions of equivalent orders. Discret. Math. Ulrich Faigle, Rainer Schrader
1986	J	`jnl`	Monge sequences and a simple assignment algorithm. Discret. Appl. Math. Ulrich Derigs, Oskar Goecke, Rainer Schrader
1986	J	`jnl`	On the computational complexity of the order polynomial. Discret. Appl. Math. Ulrich Faigle, Rainer Schrader
1986	J	`jnl`	Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
1985	J	`jnl`	Algorithmic approaches to setup minimization. SIAM J. Comput. Ulrich Faigle, Gerhard Gierz, Rainer Schrader
1984	J	`jnl`	Minimizing Completion Time for a Class of Scheduling Problems. Inf. Process. Lett. Ulrich Faigle, Rainer Schrader
1983	J	`jnl`	Approximations to clustering and subgraph problems on trees. Discret. Appl. Math. Rainer Schrader
1982	J	`jnl`	A characterization of minimal valid inequalities for mixed integer programs. Oper. Res. Lett. Achim Bachem, Ellis L. Johnson, Rainer Schrader
1982	—	`—`	Dominanzstrukturen in der kombinatorischen Optimierung. Rainer Schrader
1981	B	`conf`	A Survey on Oracle Techniques. MFCS Bernhard Korte, Rainer Schrader