Rainer Schrader

Orcid: 0000-0001-6635-0132

Affiliations:
  • University of Cologne, Germany


According to our database1, Rainer Schrader authored at least 54 papers between 1981 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A note on integral generalized flows in directed partial 2-trees.
Inf. Process. Lett., 2021

Cross-series-parallel digraphs.
Discret. Appl. Math., 2021

A characterization of interval orders with semiorder dimension two.
Discret. Appl. Math., 2021

2020
A de Bruijn-Erdös Theorem for (q, q-4)-graphs.
Discret. Appl. Math., 2020

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017).
Discret. Appl. Math., 2020

2018
A Graph-Theoretic Approach to the Train Marshalling Problem.
Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, 2018

2015
Freight car dispatching with generalized flows.
Networks, 2015

On the non-unit count of interval graphs.
Discret. Appl. Math., 2015

2013
On the separability of graphs.
Discret. Math., 2013

9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).
Discret. Appl. Math., 2013

2012
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs.
Inf. Process. Lett., 2012

Sentiment Polarity Classification Using Statistical Data Compression Models.
Proceedings of the 12th IEEE International Conference on Data Mining Workshops, 2012

2010
Distance-hereditary digraphs.
J. Discrete Algorithms, 2010

2009
Preface on CTW 2006.
Math. Methods Oper. Res., 2009

Small Molecule Subgraph Detector (SMSD) toolkit.
J. Cheminformatics, 2009

Semi-preemptive routing on a linear and circular track.
Discret. Optim., 2009

Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis.
J. Comput. Biol., 2008

Semi-preemptive routing on trees.
Discret. Appl. Math., 2008

Preface for CTW2005 special issue.
Discret. Appl. Math., 2008

2006
CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data.
Bioinform., 2006

2005
Metabolic Network Analysis: Implication And Application.
BMC Bioinform., 2005

Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC).
Bioinform., 2005

A fractional programming approach to efficient DNA melting temperature calculation.
Bioinform., 2005

2004
Fast and robust registration of PET and MR images of human brain.
NeuroImage, 2004

2002
ProClust: improved clustering of protein sequences with an extended graph-based approach.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

2001
Strongly Connected Components can Predict Protein Structure.
Electron. Notes Discret. Math., 2001

Simulated Annealing And Graph Colouring.
Comb. Probab. Comput., 2001

Clustering protein sequences-structure prediction by transitive homology.
Bioinform., 2001

Modeling and Solving an Airline Schedule Generation Problem.
Ann. Oper. Res., 2001

2000
A Note on the Finite Time Behavior of Simulated Annealing.
Math. Oper. Res., 2000

1999
The setup polytope of <i>N</i>‐sparse posets.
Ann. Oper. Res., 1999

1998
Base polytopes of series-parallel posets: Linear description and optimization.
Math. Program., 1998

1997
The Setup Polyhedron of Series-parallel Posets.
Discret. Appl. Math., 1997

Coloring in Sublinear Time.
Proceedings of the Algorithms, 1997

1996
The permutahedron of N-sparse posets.
Math. Program., 1996

Simulated Annealing and Its Problems to Color Graphs.
Proceedings of the Algorithms, 1996

1992
The Communication Complexity of Interval Orders.
Discret. Appl. Math., 1992

A greedy reduction algorithm for setup optimization.
Discret. Appl. Math., 1992

1990
Minor characterization of undirected branching greedoids - a short proof.
Discret. Math., 1990

The permutahedron of series-parallel posets.
Discret. Appl. Math., 1990

1988
Simulted Annealing -Eine Fallstudie.
Angew. Inform., 1988

On the Convergence of Stationary Distributions in Simulated Annealing Algorithms.
Inf. Process. Lett., 1988

1987
Interval orders without odd crowns are defect optimal.
Computing, 1987

1986
Searching in Trees, Series-Parallel and Interval Orders.
SIAM J. Comput., 1986

A combinatorial bijection between linear extensions of equivalent orders.
Discret. Math., 1986

On the computational complexity of the order polynomial.
Discret. Appl. Math., 1986

Monge sequences and a simple assignment algorithm.
Discret. Appl. Math., 1986

1985
Algorithmic approaches to setup minimization.
SIAM J. Comput., 1985

1984
Minimizing Completion Time for a Class of Scheduling Problems.
Inf. Process. Lett., 1984

1983
Approximations to clustering and subgraph problems on trees.
Discret. Appl. Math., 1983

1982
Dominanzstrukturen in der kombinatorischen Optimierung.
PhD thesis, 1982

A characterization of minimal valid inequalities for mixed integer programs.
Oper. Res. Lett., 1982

1981
A Survey on Oracle Techniques.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981


  Loading...