default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRainer Schrader
Person information
- affiliation: University of Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1982
[b1]Rainer Schrader:
Dominanzstrukturen in der kombinatorischen Optimierung. University of Bonn, Germany, 1982, pp. 1-217
Journal Articles
- 2021
- [j46]Alexander Apke
, Rainer Schrader:
A characterization of interval orders with semiorder dimension two. Discret. Appl. Math. 297: 142-150 (2021) - [j45]Jorin Dornemann, Rainer Schrader:
Cross-series-parallel digraphs. Discret. Appl. Math. 303: 57-65 (2021) - [j44]Andreas Billstein, Rainer Schrader:
A note on integral generalized flows in directed partial 2-trees. Inf. Process. Lett. 172: 106147 (2021) - 2020
- [j43]Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin:
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272: 1 (2020) - [j42]Rainer Schrader, Lukas Stenmans:
A de Bruijn-Erdös Theorem for (q, q-4)-graphs. Discret. Appl. Math. 279: 198-201 (2020) - 2015
- [j41]Alexander Apke, Rainer Schrader:
On the non-unit count of interval graphs. Discret. Appl. Math. 195: 2-7 (2015) - [j40]Birgit Engels, Rainer Schrader:
Freight car dispatching with generalized flows. Networks 66(1): 33-39 (2015) - 2013
- [j39]Ulrich Faigle, Rainer Schrader:
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). Discret. Appl. Math. 161(12): 1673 (2013) - [j38]Oliver Schaudt, Rainer Schrader, Vera Weil:
On the separability of graphs. Discret. Math. 313(6): 809-820 (2013) - 2012
- [j37]Oliver Schaudt, Rainer Schrader:
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs. Inf. Process. Lett. 112(24): 953-957 (2012) - 2010
- [j36]Martin Lätsch, Rainer Schrader:
Distance-hereditary digraphs. J. Discrete Algorithms 8(2): 231-240 (2010) - 2009
- [j35]Dirk Räbiger, Rainer Schrader:
Semi-preemptive routing on a linear and circular track. Discret. Optim. 6(3): 223-230 (2009) - [j34]Syed Asad Rahman, Matthew Bashton, Gemma L. Holliday, Rainer Schrader, Janet M. Thornton:
Small Molecule Subgraph Detector (SMSD) toolkit. J. Cheminformatics 1: 12 (2009) - [j33]Ulrich Faigle, Rainer Schrader, Rüdiger Schultz:
Preface on CTW 2006. Math. Methods Oper. Res. 69(2): 203-204 (2009) - 2008
- [j32]Ulrich Faigle, Bert Randerath, Rainer Schrader:
Preface for CTW2005 special issue. Discret. Appl. Math. 156(17): 3155 (2008) - [j31]Sven Oliver Krumke, Dirk Räbiger, Rainer Schrader:
Semi-preemptive routing on trees. Discret. Appl. Math. 156(17): 3298-3304 (2008) - [j30]Jutta Gebert, Susanne Motameny, Ulrich Faigle, Christian V. Forst, Rainer Schrader:
Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis. J. Comput. Biol. 15(2): 185-194 (2008) - 2006
- [j29]Lars Kaderali, Thomas Zander, Ulrich Faigle, Jürgen Wolf, Joachim L. Schultze, Rainer Schrader:
CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data. Bioinform. 22(12): 1495-1502 (2006) - 2005
- [j28]Syed Asad Rahman, P. Advani, R. Schunk, Rainer Schrader, Dietmar Schomburg:
Metabolic pathway analysis web service (Pathway Hunter Tool at CUBIC). Bioinform. 21(7): 1189-1193 (2005) - [j27]Markus Leber, Lars Kaderali, Alexander Schönhuth, Rainer Schrader:
A fractional programming approach to efficient DNA melting temperature calculation. Bioinform. 21(10): 2375-2382 (2005) - [j26]Syed Asad Rahman, Pardha Saradhi Jonnalagadda, Jyothi Padiadpu, Kai Hartmann, Rainer Schrader, Dietmar Schomburg:
Metabolic Network Analysis: Implication And Application. BMC Bioinform. 6(S-3) (2005) - 2004
- [j25]Jiri Cizek, Karl Herholz, Stefan Vollmar, Rainer Schrader, Johannes Klein, Wolf-Dieter Heiss:
Fast and robust registration of PET and MR images of human brain. NeuroImage 22(1): 434-442 (2004) - 2001
- [j24]A. Erdmann, Andreas Nolte, A. Noltemeier, Rainer Schrader:
Modeling and Solving an Airline Schedule Generation Problem. Ann. Oper. Res. 107(1-4): 117-142 (2001) - [j23]Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader:
Clustering protein sequences-structure prediction by transitive homology. Bioinform. 17(10): 935-941 (2001) - [j22]Andreas Nolte, Rainer Schrader:
Simulated Annealing And Graph Colouring. Comb. Probab. Comput. 10(1): 29-40 (2001) - [j21]Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader:
Strongly Connected Components can Predict Protein Structure. Electron. Notes Discret. Math. 8: 10-13 (2001) - 2000
- [j20]Andreas Nolte, Rainer Schrader:
A Note on the Finite Time Behavior of Simulated Annealing. Math. Oper. Res. 25(3): 476-484 (2000) - 1999
- [j19]Rainer Schrader, Georg Wambach:
The setup polytope of N‐sparse posets. Ann. Oper. Res. 92: 125-142 (1999) - 1998
- [j18]Rainer Schrader, Andreas S. Schulz, Georg Wambach:
Base polytopes of series-parallel posets: Linear description and optimization. Math. Program. 82: 159-173 (1998) - 1997
- [j17]Rainer Schrader, Georg Wambach:
The Setup Polyhedron of Series-parallel Posets. Discret. Appl. Math. 79(1-3): 213-221 (1997) - 1996
- [j16]Annelie von Arnim, Rainer Schrader, Yaoguang Wang:
The permutahedron of N-sparse posets. Math. Program. 75: 1-18 (1996) - 1992
- [j15]Ulrich Faigle, Rainer Schrader:
A greedy reduction algorithm for setup optimization. Discret. Appl. Math. 35(1): 73-79 (1992) - [j14]Ulrich Faigle, Rainer Schrader, György Turán:
The Communication Complexity of Interval Orders. Discret. Appl. Math. 40(1): 19-28 (1992) - 1990
- [j13]Annelie von Arnim, Ulrich Faigle, Rainer Schrader:
The permutahedron of series-parallel posets. Discret. Appl. Math. 28(1): 3-9 (1990) - [j12]Oskar Goecke, Rainer Schrader:
Minor characterization of undirected branching greedoids - a short proof. Discret. Math. 82(1): 93-99 (1990) - 1988
- [j11]Ulrich Faigle, Rainer Schrader:
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. 27(4): 189-194 (1988) - [j10]Ulrich Faigle, Rainer Schrader:
Simulted Annealing -Eine Fallstudie. Angew. Inform. 30(6): 259-263 (1988) - 1987
- [j9]Ulrich Faigle, Rainer Schrader:
Interval orders without odd crowns are defect optimal. Computing 38(1): 59-69 (1987) - 1986
- [j8]Ulrich Derigs, Oskar Goecke, Rainer Schrader:
Monge sequences and a simple assignment algorithm. Discret. Appl. Math. 15(2-3): 241-248 (1986) - [j7]Ulrich Faigle, Rainer Schrader:
On the computational complexity of the order polynomial. Discret. Appl. Math. 15(2-3): 261-269 (1986) - [j6]Ulrich Faigle, Rainer Schrader:
A combinatorial bijection between linear extensions of equivalent orders. Discret. Math. 58(3): 295-301 (1986) - [j5]Ulrich Faigle, László Lovász, Rainer Schrader, György Turán:
Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. 15(4): 1075-1084 (1986) - 1985
- [j4]Ulrich Faigle, Gerhard Gierz, Rainer Schrader:
Algorithmic approaches to setup minimization. SIAM J. Comput. 14(4): 954-965 (1985) - 1984
- [j3]Ulrich Faigle, Rainer Schrader:
Minimizing Completion Time for a Class of Scheduling Problems. Inf. Process. Lett. 19(1): 27-29 (1984) - 1983
- [j2]Rainer Schrader:
Approximations to clustering and subgraph problems on trees. Discret. Appl. Math. 6(3): 301-309 (1983) - 1982
- [j1]Achim Bachem, Ellis L. Johnson, Rainer Schrader:
A characterization of minimal valid inequalities for mixed integer programs. Oper. Res. Lett. 1(2): 63-66 (1982)
Conference and Workshop Papers
- 2018
- [c9]Jens Dörpinghaus, Rainer Schrader:
A Graph-Theoretic Approach to the Train Marshalling Problem. FedCSIS 2018: 227-231 - 2012
- [c8]Oliver Schaudt, Rainer Schrader, Vera Weil:
On the Separability of Graphs. CTW 2012: 232-236 - [c7]Dominique Ziegelmayer, Rainer Schrader:
Sentiment Polarity Classification Using Statistical Data Compression Models. ICDM Workshops 2012: 731-738 - 2009
- [c6]Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck:
Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2. CTW 2009: 239-243 - 2002
- [c5]P. Pipenbacher, Alexander Schliep, Sebastian Schneckener, Alexander Schönhuth, Dietmar Schomburg, Rainer Schrader:
ProClust: improved clustering of protein sequences with an extended graph-based approach. ECCB 2002: 182-191 - 1999
- [c4]Eva Bolten, Alexander Schliep, Sebastian Schneckener, Dietmar Schomburg, Rainer Schrader:
Clustering Protein Sequences ? Structure Prediction by Transitive Homology. German Conference on Bioinformatics 1999: 181 - 1997
- [c3]Andreas Nolte, Rainer Schrader:
Coloring in Sublinear Time. ESA 1997: 388-401 - 1996
- [c2]Andreas Nolte, Rainer Schrader:
Simulated Annealing and Its Problems to Color Graphs. ESA 1996: 138-151 - 1981
- [c1]Bernhard Korte, Rainer Schrader:
A Survey on Oracle Techniques. MFCS 1981: 61-77
Editorship
- 2010
- [e1]Ulrich Faigle, Rainer Schrader, Daniel Herrmann:
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts. 2010 [contents]
Informal and Other Publications
- 2015
- [i1]Alexander Apke, Rainer Schrader:
On the non-unit count of interval graphs. CTW 2015: 67-68
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
