@book{Knepper2000, author = {Knepper, Ludger}, title = {Konzeptentwicklung verkehrstechnische Organisation des Pfortenbereichs eines Industrieunternehmens}, address = {FH Aachen}, year = {2000}, language = {de} } @book{Knepper2001, author = {Knepper, Ludger}, title = {Entwicklung neuer Generalbebauungsplan f{\"u}r ein Industrieunternehmen}, address = {FH Aachen}, year = {2001}, language = {de} } @book{Knepper2003, author = {Knepper, Ludger}, title = {Konzeptentwicklung Distributionszentrum f{\"u}r Tissue-Papiere}, address = {FH Aachen}, year = {2003}, language = {de} } @book{Knepper2003, author = {Knepper, Ludger}, title = {Procurement Optimizer - Rechner- und internetgest{\"u}tztes Tool zur Optimierung der Materialbeschaffung in der Produktion}, address = {FH Aachen}, year = {2003}, language = {de} } @book{Knepper2004, author = {Knepper, Ludger}, title = {Aufbau eines Benchmark-Systems f{\"u}r operative Unternehmensprozesse}, address = {FH Aachen}, year = {2004}, language = {de} } @book{Knepper2004, author = {Knepper, Ludger}, title = {Auslegung und Konstruktion von Hallentorantrieben}, address = {FH Aachen}, year = {2004}, language = {de} } @book{Knepper1992, author = {Knepper, Ludger}, title = {Das Rolltor : Bauwerk{\"o}ffnungs-Abschl{\"u}sse ; Aufbau, Konstruktion, Hinweise zur Berechnung / von Horst G{\"u}nter Steuff ; unter Mitarb. von Ludger Knepper ; Frieder Thiele}, publisher = {Werner}, address = {D{\"u}sseldorf}, isbn = {3-8041-3165-4}, pages = {XI, 227 S. : zahlr. graph. Darst.}, year = {1992}, language = {de} } @article{Knepper1985, author = {Knepper, Ludger}, title = {Der moderne Luftfrachtverkehr - leistungsfaehig durch seine bodengebundenen Umschlagssysteme}, pages = {60 -- 69}, year = {1985}, language = {de} } @article{Knepper1985, author = {Knepper, Ludger}, title = {Hochregallager fuer Luftfracht - 365 Tage pro Jahr in Betrieb}, series = {Foerdern und Heben. 35 (1985), H. 5}, journal = {Foerdern und Heben. 35 (1985), H. 5}, isbn = {0341-2636}, pages = {363 -- 366}, year = {1985}, language = {de} } @article{Knepper1984, author = {Knepper, Ludger}, title = {Integrierte Hochregallager als materialflusstechnische Knotenpunkte moderner Produktions- und Umschlaganlagen}, pages = {93 -- 100}, year = {1984}, language = {de} } @article{Knepper1983, author = {Knepper, Ludger}, title = {Verstaerkte materialflusstechnische Integration von Hochregallagern in Produktions- und Umschlaganlagen}, pages = {219 -- 224}, year = {1983}, language = {de} } @article{Knepper1981, author = {Knepper, Ludger}, title = {Im neuen Lufthansa-Frachtterminal: vom Hochregallager direkt ins Flugzeug}, series = {Foerdermittel Journal. Kennzifferzeitschrift fuer Materialfluss, Lager und Transport. 13 (1981), H. 7/8}, journal = {Foerdermittel Journal. Kennzifferzeitschrift fuer Materialfluss, Lager und Transport. 13 (1981), H. 7/8}, isbn = {0013-5674}, pages = {22 -- 24}, year = {1981}, language = {de} } @book{Knepper1978, author = {Knepper, Ludger}, title = {Einsatz undAuslegung von Hochlagersystemen fuer Container, dargestellt am Beispiel einer Seehafenumschlaganlage}, address = {Aachen}, year = {1978}, language = {de} } @article{Knepper1984, author = {Knepper, Ludger}, title = {Integrierte Hochregallager als materialflusstechnische Knotenpunkte moderner Produktions- und Umschlaganlagen}, series = {Deutsche Hebe- und Foerdertechnik. 30 (1984), H. 12}, journal = {Deutsche Hebe- und Foerdertechnik. 30 (1984), H. 12}, isbn = {0012-0278}, pages = {88 -- 93}, year = {1984}, language = {de} } @article{Knepper1996, author = {Knepper, Ludger}, title = {Simulation: Vom reinen Planungswerkzeug zum Betriebsf{\"u}hrungs-Instrument}, series = {Foerdern und Heben. 46 (1996), H. 3}, journal = {Foerdern und Heben. 46 (1996), H. 3}, isbn = {0341-2636}, pages = {158 -- 160}, year = {1996}, language = {de} } @book{KnepperPfeiffer1995, author = {Knepper, Ludger and Pfeiffer, Johann}, title = {Diplom-Ingenieur/Diplom-Ingenieurin (Fachhochschule) Maschinenbau - Allgemeiner Maschinenbau}, publisher = {Bertelsmann}, address = {Bielefeld}, pages = {Loseblattausg.}, year = {1995}, language = {de} } @book{KnepperPfeiffer1998, author = {Knepper, Ludger and Pfeiffer, Johann}, title = {Diplom-Ingenieur/Diplom-Ingenieurin (Fachhochschule) Maschinenbau Konstruktionstechnik}, publisher = {Bertelsmann}, address = {Bielefeld}, pages = {Loseblattausg.}, year = {1998}, language = {de} } @book{KnepperPfeiffer1999, author = {Knepper, Ludger and Pfeiffer, Johann}, title = {Diplom-Ingenieur / Diplom-Ingenieurin (Fachhochschule) Maschinenbau, Energie- und W{\"a}rmetechnik}, publisher = {Bertelsmann}, address = {Bielefeld}, pages = {Loseblattausg.}, year = {1999}, language = {de} } @inproceedings{KolkmannGriesSchleseretal.2005, author = {Kolkmann, Annette and Gries, Thomas and Schleser, Markus and Dilthey, Ulrich}, title = {Innovative yarn structures and coatings for textile reinforced concrete}, series = {All lectures / Techtextil Symposium : 6. - 9. 6.2005, Frankfurt am Main}, booktitle = {All lectures / Techtextil Symposium : 6. - 9. 6.2005, Frankfurt am Main}, address = {Frankfurt a.M.}, pages = {1 CD-ROM}, year = {2005}, language = {en} } @article{KosterScheidweilerTieves2016, author = {Koster, Arie and Scheidweiler, Robert and Tieves, Martin}, title = {A flow based pruning scheme for enumerative equitable coloring algorithms}, series = {A flow based pruning scheme for enumerative equitable coloring algorithms}, journal = {A flow based pruning scheme for enumerative equitable coloring algorithms}, doi = {10.48550/arXiv.1607.08754}, pages = {1 -- 30}, year = {2016}, abstract = {An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest number k such that G admits such equitable k-coloring. We focus on enumerative algorithms for the computation of the equitable coloring number and propose a general scheme to derive pruning rules for them: We show how the extendability of a partial coloring into an equitable coloring can be modeled via network flows. Thus, we obtain pruning rules which can be checked via flow algorithms. Computational experiments show that the search tree of enumerative algorithms can be significantly reduced in size by these rules and, in most instances, such naive approach even yields a faster algorithm. Moreover, the stability, i.e., the number of solved instances within a given time limit, is greatly improved. Since the execution of flow algorithms at each node of a search tree is time consuming, we derive arithmetic pruning rules (generalized Hall-conditions) from the network model. Adding these rules to an enumerative algorithm yields an even larger runtime improvement.}, language = {en} }