default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Eugene L. Lawler
@article{DBLP:journals/tcs/BafnaLP97,
author = {Vineet Bafna and
Eugene L. Lawler and
Pavel A. Pevzner},
title = {Approximation Algorithms for Multiple Sequence Alignment},
journal = {Theor. Comput. Sci.},
volume = {182},
number = {1-2},
pages = {233--244},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(97)00023-6},
doi = {10.1016/S0304-3975(97)00023-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BafnaLP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WangJL96,
author = {Lusheng Wang and
Tao Jiang and
Eugene L. Lawler},
title = {Approximation Algorithms for Tree Alignment with a Given Phylogeny},
journal = {Algorithmica},
volume = {16},
number = {3},
pages = {302--315},
year = {1996},
url = {https://doi.org/10.1007/BF01955679},
doi = {10.1007/BF01955679},
timestamp = {Tue, 13 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WangJL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KannanLW96,
author = {Sampath Kannan and
Eugene L. Lawler and
Tandy J. Warnow},
title = {Determining the Evolutionary Tree Using Experiments},
journal = {J. Algorithms},
volume = {21},
number = {1},
pages = {26--50},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0035},
doi = {10.1006/JAGM.1996.0035},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KannanLW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/VarvarigouRKL96,
author = {Theodora A. Varvarigou and
Vwani P. Roychowdhury and
Thomas Kailath and
Eugene L. Lawler},
title = {Scheduling In and Out Forests in the Presence of Communication Delays},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {7},
number = {10},
pages = {1065--1074},
year = {1996},
url = {https://doi.org/10.1109/71.539738},
doi = {10.1109/71.539738},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/VarvarigouRKL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LawlerS95,
author = {Eugene L. Lawler and
Sergei Sarkissian},
title = {An Algorithm for "Ulam's Game" and its Application to Error
Correcting Codes},
journal = {Inf. Process. Lett.},
volume = {56},
number = {2},
pages = {89--93},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00127-X},
doi = {10.1016/0020-0190(95)00127-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LawlerS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChangL94,
author = {William I. Chang and
Eugene L. Lawler},
title = {Sublinear Approximate String Matching and Biological Applications},
journal = {Algorithmica},
volume = {12},
number = {4/5},
pages = {327--344},
year = {1994},
url = {https://doi.org/10.1007/BF01185431},
doi = {10.1007/BF01185431},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChangL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BafnaLP94,
author = {Vineet Bafna and
Eugene L. Lawler and
Pavel A. Pevzner},
editor = {Maxime Crochemore and
Dan Gusfield},
title = {Approximation Algorithms for Multiple Sequence Alignment},
booktitle = {Combinatorial Pattern Matching, 5th Annual Symposium, {CPM} 94, Asilomar,
California, USA, June 5-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {807},
pages = {43--53},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58094-8\_4},
doi = {10.1007/3-540-58094-8\_4},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BafnaLP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JiangLW94,
author = {Tao Jiang and
Eugene L. Lawler and
Lusheng Wang},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Aligning sequences via an evolutionary tree: complexity and approximation},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {760--769},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195454},
doi = {10.1145/195058.195454},
timestamp = {Mon, 05 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JiangLW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/93/LawlerLKS93,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
Alexander H. G. Rinnooy Kan and
David B. Shmoys},
editor = {Stephen C. Graves and
Alexander H. G. Rinnooy Kan and
Paul Herbert Zipkin},
title = {Chapter 9 Sequencing and scheduling: Algorithms and complexity},
booktitle = {Logistics of Production and Inventory},
series = {Handbooks in Operations Research and Management Science},
volume = {4},
pages = {445--522},
publisher = {North-Holland},
year = {1993},
url = {https://doi.org/10.1016/s0927-0507(05)80189-6},
doi = {10.1016/S0927-0507(05)80189-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/93/LawlerLKS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Lawler91,
author = {Eugene L. Lawler},
title = {Computing shortest paths in networks derived from recurrence relations},
journal = {Ann. Oper. Res.},
volume = {33},
number = {5},
pages = {363--377},
year = {1991},
url = {https://doi.org/10.1007/BF02073941},
doi = {10.1007/BF02073941},
timestamp = {Mon, 29 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Lawler91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/GonzalezLS90,
author = {Teofilo F. Gonzalez and
Eugene L. Lawler and
Sartaj Sahni},
title = {Optimal Preemptive Scheduling of Two Unrelated Processors},
journal = {{INFORMS} J. Comput.},
volume = {2},
number = {3},
pages = {219--224},
year = {1990},
url = {https://doi.org/10.1287/ijoc.2.3.219},
doi = {10.1287/IJOC.2.3.219},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/GonzalezLS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HilfingerLR90,
author = {Paul N. Hilfinger and
Eugene L. Lawler and
G{\"{u}}nter Rote},
editor = {Peter Gritzmann and
Bernd Sturmfels},
title = {Flattening a Rooted Tree},
booktitle = {Applied Geometry And Discrete Mathematics, Proceedings of a {DIMACS}
Workshop, Providence, Rhode Island, USA, September 18, 1990},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {4},
pages = {335--340},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/004/26},
doi = {10.1090/DIMACS/004/26},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HilfingerLR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChangL90,
author = {William I. Chang and
Eugene L. Lawler},
title = {Approximate String Matching in Sublinear Expected Time},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {116--124},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89530},
doi = {10.1109/FSCS.1990.89530},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChangL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KannanLW90,
author = {Sampath Kannan and
Eugene L. Lawler and
Tandy J. Warnow},
editor = {David S. Johnson},
title = {Determining the Evolutionary Tree},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {475--484},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320234},
timestamp = {Thu, 05 Jul 2018 07:28:50 +0200},
biburl = {https://dblp.org/rec/conf/soda/KannanLW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LawlerM89,
author = {Eugene L. Lawler and
Charles U. Martel},
title = {Preemptive Scheduling of Two Uniform Machines to Minimize the Number
of Late Jobs},
journal = {Oper. Res.},
volume = {37},
number = {2},
pages = {314--318},
year = {1989},
url = {https://doi.org/10.1287/opre.37.2.314},
doi = {10.1287/OPRE.37.2.314},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LawlerM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ChangL88,
author = {William I. Chang and
Eugene L. Lawler},
title = {Edge coloring of hypergraphs and a conjecture of Erd{\"{o}}s,
Faber, Lov{\'{a}}sz},
journal = {Comb.},
volume = {8},
number = {3},
pages = {293--295},
year = {1988},
url = {https://doi.org/10.1007/BF02126801},
doi = {10.1007/BF02126801},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ChangL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BernLW87,
author = {Marshall W. Bern and
Eugene L. Lawler and
A. L. Wong},
title = {Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs},
journal = {J. Algorithms},
volume = {8},
number = {2},
pages = {216--235},
year = {1987},
url = {https://doi.org/10.1016/0196-6774(87)90039-3},
doi = {10.1016/0196-6774(87)90039-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BernLW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LawlerM86,
author = {Eugene L. Lawler and
Charles U. Martel},
title = {Polymatroidal flows with lower bounds},
journal = {Discret. Appl. Math.},
volume = {15},
number = {2-3},
pages = {291--313},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90050-8},
doi = {10.1016/0166-218X(86)90050-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LawlerM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernLW85,
author = {Marshall W. Bern and
Eugene L. Lawler and
A. L. Wong},
title = {Why Certain Subgraph Computations Require Only Linear Time},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {117--125},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.66},
doi = {10.1109/SFCS.1985.66},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernLW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BakerLLK83,
author = {K. R. Baker and
Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Preemptive Scheduling of a Single Machine to Minimize Maximum Cost
Subject to Release Dates and Precedence Constraints},
journal = {Oper. Res.},
volume = {31},
number = {2},
pages = {381--386},
year = {1983},
url = {https://doi.org/10.1287/opre.31.2.381},
doi = {10.1287/OPRE.31.2.381},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/BakerLLK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TongL83,
author = {Po Tong and
Eugene L. Lawler},
title = {A Faster Algorithm for Finding Edge-Disjoint Branchings},
journal = {Inf. Process. Lett.},
volume = {17},
number = {2},
pages = {73--76},
year = {1983},
url = {https://doi.org/10.1016/0020-0190(83)90073-X},
doi = {10.1016/0020-0190(83)90073-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TongL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LawlerLP83,
author = {Eugene L. Lawler and
Michael George Luby and
B. Parker},
editor = {Manfred Nagl and
J{\"{u}}rgen Perl},
title = {Finding Shortest Paths in Very Large Networks},
booktitle = {Proceedings of the {WG} '83, International Workshop on Graphtheoretic
Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near
Osnabr{\"{u}}ck, Germany},
pages = {184--199},
publisher = {Universit{\"{a}}tsverlag Rudolf Trauner, Linz},
year = {1983},
timestamp = {Thu, 12 Mar 2020 11:37:19 +0100},
biburl = {https://dblp.org/rec/conf/wg/LawlerLP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LawlerM82,
author = {Eugene L. Lawler and
Charles U. Martel},
title = {Computing Maximal "Polymatroidal" Network Flows},
journal = {Math. Oper. Res.},
volume = {7},
number = {3},
pages = {334--347},
year = {1982},
url = {https://doi.org/10.1287/moor.7.3.334},
doi = {10.1287/MOOR.7.3.334},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LawlerM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LawlerLK82,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Erratum},
journal = {Math. Oper. Res.},
volume = {7},
number = {4},
pages = {635},
year = {1982},
url = {https://doi.org/10.1287/moor.7.4.635},
doi = {10.1287/MOOR.7.4.635},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LawlerLK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LawlerLV82,
author = {Eugene L. Lawler and
Michael George Luby and
Vijay V. Vazirani},
title = {Scheduling open shops with parallel machines},
journal = {Oper. Res. Lett.},
volume = {1},
number = {4},
pages = {161--164},
year = {1982},
url = {https://doi.org/10.1016/0167-6377(82)90021-9},
doi = {10.1016/0167-6377(82)90021-9},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LawlerLV82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Lawler82,
author = {Eugene L. Lawler},
title = {A fully polynomial approximation scheme for the total tardiness problem},
journal = {Oper. Res. Lett.},
volume = {1},
number = {6},
pages = {207--208},
year = {1982},
url = {https://doi.org/10.1016/0167-6377(82)90022-0},
doi = {10.1016/0167-6377(82)90022-0},
timestamp = {Mon, 29 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Lawler82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ValdesTL82,
author = {Jacobo Valdes and
Robert Endre Tarjan and
Eugene L. Lawler},
title = {The Recognition of Series Parallel Digraphs},
journal = {{SIAM} J. Comput.},
volume = {11},
number = {2},
pages = {298--313},
year = {1982},
url = {https://doi.org/10.1137/0211023},
doi = {10.1137/0211023},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ValdesTL82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismp/Lawler82,
author = {Eugene L. Lawler},
editor = {Achim Bachem and
Bernhard Korte and
Martin Gr{\"{o}}tschel},
title = {Recent Results in the Theory of Machine Scheduling},
booktitle = {Mathematical Programming The State of the Art, XIth International
Symposium on Mathematical Programming, Bonn, Germany, August 23-27,
1982},
pages = {202--234},
publisher = {Springer},
year = {1982},
url = {https://doi.org/10.1007/978-3-642-68874-4\_9},
doi = {10.1007/978-3-642-68874-4\_9},
timestamp = {Mon, 29 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ismp/Lawler82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LawlerM81,
author = {Eugene L. Lawler and
Charles U. Martel},
title = {Scheduling Periodically Occurring Tasks on Multiple Processors},
journal = {Inf. Process. Lett.},
volume = {12},
number = {1},
pages = {9--12},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90066-1},
doi = {10.1016/0020-0190(81)90066-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LawlerM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LawlerLK81,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Minimizing Maximum Lateness in a Two-Machine Open Shop},
journal = {Math. Oper. Res.},
volume = {6},
number = {1},
pages = {153--158},
year = {1981},
url = {https://doi.org/10.1287/moor.6.1.153},
doi = {10.1287/MOOR.6.1.153},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/LawlerLK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LawlerLK80,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time
Algorithms},
journal = {{SIAM} J. Comput.},
volume = {9},
number = {3},
pages = {558--565},
year = {1980},
url = {https://doi.org/10.1137/0209042},
doi = {10.1137/0209042},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LawlerLK80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Lawler79,
author = {Eugene L. Lawler},
title = {Fast Approximation Algorithms for Knapsack Problems},
journal = {Math. Oper. Res.},
volume = {4},
number = {4},
pages = {339--356},
year = {1979},
url = {https://doi.org/10.1287/moor.4.4.339},
doi = {10.1287/MOOR.4.4.339},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Lawler79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ValdesTL79,
author = {Jacobo Valdes and
Robert Endre Tarjan and
Eugene L. Lawler},
editor = {Michael J. Fischer and
Richard A. DeMillo and
Nancy A. Lynch and
Walter A. Burkhard and
Alfred V. Aho},
title = {The recognition of Series Parallel digraphs},
booktitle = {Proceedings of the 11h Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1979, Atlanta, Georgia, {USA}},
pages = {1--12},
publisher = {{ACM}},
year = {1979},
url = {https://doi.org/10.1145/800135.804393},
doi = {10.1145/800135.804393},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ValdesTL79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LawlerS78,
author = {Eugene L. Lawler and
B. D. Sivazlian},
title = {Minimization of Time-Varying Costs in Single-Machine Scheduling},
journal = {Oper. Res.},
volume = {26},
number = {4},
pages = {563--569},
year = {1978},
url = {https://doi.org/10.1287/opre.26.4.563},
doi = {10.1287/OPRE.26.4.563},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LawlerS78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LawlerL78,
author = {Eugene L. Lawler and
Jacques Labetoulle},
title = {On Preemptive Scheduling of Unrelated Parallel Processors by Linear
Programming},
journal = {J. {ACM}},
volume = {25},
number = {4},
pages = {612--619},
year = {1978},
url = {https://doi.org/10.1145/322092.322101},
doi = {10.1145/322092.322101},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LawlerL78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Lawler77,
author = {Eugene L. Lawler},
title = {Comment on Computing the k Shortest Paths in a Graph},
journal = {Commun. {ACM}},
volume = {20},
number = {8},
pages = {603--604},
year = {1977},
url = {https://doi.org/10.1145/359763.359804},
doi = {10.1145/359763.359804},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/Lawler77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lawler77,
author = {Eugene L. Lawler},
title = {Fast Approximation Algorithms for Knapsack Problems},
booktitle = {18th Annual Symposium on Foundations of Computer Science, Providence,
Rhode Island, USA, 31 October - 1 November 1977},
pages = {206--213},
publisher = {{IEEE} Computer Society},
year = {1977},
url = {https://doi.org/10.1109/SFCS.1977.11},
doi = {10.1109/SFCS.1977.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lawler77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Lawler76,
author = {Eugene L. Lawler},
title = {A Note on the Complexity of the Chromatic Number Problem},
journal = {Inf. Process. Lett.},
volume = {5},
number = {3},
pages = {66--67},
year = {1976},
url = {https://doi.org/10.1016/0020-0190(76)90065-X},
doi = {10.1016/0020-0190(76)90065-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Lawler76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lawler75,
author = {Eugene L. Lawler},
title = {Matroid intersection algorithms},
journal = {Math. Program.},
volume = {9},
number = {1},
pages = {31--56},
year = {1975},
url = {https://doi.org/10.1007/BF01681329},
doi = {10.1007/BF01681329},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Lawler75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Lawler75,
author = {Eugene L. Lawler},
title = {Algorithms, Graphs, and Complexity},
journal = {Networks},
volume = {5},
number = {4},
pages = {89--92},
year = {1975},
url = {https://doi.org/10.1002/net.1975.5.1.89},
doi = {10.1002/NET.1975.5.1.89},
timestamp = {Mon, 29 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Lawler75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KunduL73,
author = {Sukhamay Kundu and
Eugene L. Lawler},
title = {A matroid generalization of a theorem of Mendelsohn and Dulmage},
journal = {Discret. Math.},
volume = {4},
number = {2},
pages = {159--163},
year = {1973},
url = {https://doi.org/10.1016/0012-365X(73)90078-2},
doi = {10.1016/0012-365X(73)90078-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KunduL73.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Lawler73,
author = {Eugene L. Lawler},
title = {Cutsets and partitions of hypergraphs},
journal = {Networks},
volume = {3},
number = {3},
pages = {275--285},
year = {1973},
url = {https://doi.org/10.1002/net.3230030306},
doi = {10.1002/NET.3230030306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Lawler73.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lawler71,
author = {Eugene L. Lawler},
title = {A solvable case of the traveling salesman problem},
journal = {Math. Program.},
volume = {1},
number = {1},
pages = {267--269},
year = {1971},
url = {https://doi.org/10.1007/BF01584089},
doi = {10.1007/BF01584089},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Lawler71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/Lawler70,
author = {Eugene L. Lawler},
title = {{R70-9} {A} Graph-Theoretic Model for Periodic Discrete Structures},
journal = {{IEEE} Trans. Computers},
volume = {19},
number = {6},
pages = {563},
year = {1970},
url = {https://doi.org/10.1109/T-C.1970.222980},
doi = {10.1109/T-C.1970.222980},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/Lawler70.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/LawlerLT69,
author = {Eugene L. Lawler and
Karl N. Levitt and
James Turner},
title = {Module Clustering to Minimize Delay in Digital Networks},
journal = {{IEEE} Trans. Computers},
volume = {18},
number = {1},
pages = {47--57},
year = {1969},
url = {https://doi.org/10.1109/T-C.1969.222524},
doi = {10.1109/T-C.1969.222524},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/LawlerLT69.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LawlerP67,
author = {Eugene L. Lawler and
Thomas F. Piatkowski},
title = {Generalized State Identification Problems},
booktitle = {8th Annual Symposium on Switching and Automata Theory, Austin, Texas,
USA, October 18-20, 1967},
pages = {252--254},
publisher = {{IEEE} Computer Society},
year = {1967},
url = {https://doi.org/10.1109/FOCS.1967.14},
doi = {10.1109/FOCS.1967.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LawlerP67.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LawlerW66,
author = {Eugene L. Lawler and
D. E. Wood},
title = {Branch-and-Bound Methods: {A} Survey},
journal = {Oper. Res.},
volume = {14},
number = {4},
pages = {699--719},
year = {1966},
url = {https://doi.org/10.1287/opre.14.4.699},
doi = {10.1287/OPRE.14.4.699},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LawlerW66.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LawlerB66,
author = {Eugene L. Lawler and
M. D. Bell},
title = {A Method for Solving Discrete Optimization Problems},
journal = {Oper. Res.},
volume = {14},
number = {6},
pages = {1098--1112},
year = {1966},
url = {https://doi.org/10.1287/opre.14.6.1098},
doi = {10.1287/OPRE.14.6.1098},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LawlerB66.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GonzalezL65,
author = {R. Gonzalez and
Eugene L. Lawler},
title = {Two-level threshold minimization},
booktitle = {6th Annual Symposium on Switching Circuit Theory and Logical Design,
Ann Arbor, Michigan, USA, October 6-8, 1965},
pages = {41--44},
publisher = {{IEEE} Computer Society},
year = {1965},
url = {https://doi.org/10.1109/FOCS.1965.35},
doi = {10.1109/FOCS.1965.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GonzalezL65.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lawler64,
author = {Eugene L. Lawler},
title = {An Approach to Multilevel Boolean Minimization},
journal = {J. {ACM}},
volume = {11},
number = {3},
pages = {283--295},
year = {1964},
url = {https://doi.org/10.1145/321229.321232},
doi = {10.1145/321229.321232},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lawler64.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArnoldL63,
author = {Richard F. Arnold and
Eugene L. Lawler},
title = {On the analysis of functional symmetry},
booktitle = {4th Annual Symposium on Switching Circuit Theory and Logical Design,
Chicago, Illinois, USA, October 28-30, 1963},
pages = {53--62},
publisher = {{IEEE} Computer Society},
year = {1963},
url = {https://doi.org/10.1109/SWCT.1963.11},
doi = {10.1109/SWCT.1963.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ArnoldL63.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lawler63,
author = {Eugene L. Lawler},
title = {The minimal synthesis of tree structures},
booktitle = {4th Annual Symposium on Switching Circuit Theory and Logical Design,
Chicago, Illinois, USA, October 28-30, 1963},
pages = {63--82},
publisher = {{IEEE} Computer Society},
year = {1963},
url = {https://doi.org/10.1109/SWCT.1963.14},
doi = {10.1109/SWCT.1963.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lawler63.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/Lawler62,
author = {Eugene L. Lawler},
title = {Correction to "Minimization of Switching Circuits Subject to
Reliability Conditions"},
journal = {{IRE} Trans. Electron. Comput.},
volume = {11},
number = {2},
pages = {289},
year = {1962},
url = {https://doi.org/10.1109/TEC.1962.5219367},
doi = {10.1109/TEC.1962.5219367},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/Lawler62.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lawler62,
author = {Eugene L. Lawler},
title = {Minimal Boolean expressions with more than two levels of sums and
products},
booktitle = {3rd Annual Symposium on Switching Circuit Theory and Logical Design,
Chicago, Illinois, USA, October 7-12, 1962},
pages = {49--59},
publisher = {{IEEE} Computer Society},
year = {1962},
url = {https://doi.org/10.1109/FOCS.1962.9},
doi = {10.1109/FOCS.1962.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lawler62.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/Lawler61,
author = {Eugene L. Lawler},
title = {Minimization of Switching Circuits Subject to Reliability Conditions},
journal = {{IRE} Trans. Electron. Comput.},
volume = {10},
number = {4},
pages = {781--782},
year = {1961},
url = {https://doi.org/10.1109/TEC.1961.5219293},
doi = {10.1109/TEC.1961.5219293},
timestamp = {Mon, 29 Mar 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/Lawler61.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/LawlerS60,
author = {Eugene L. Lawler and
Gerard A. Salton},
title = {The Use of Parenthesis-Free Notation for the Automatic Design of Switching
Circuits},
journal = {{IRE} Trans. Electron. Comput.},
volume = {9},
number = {3},
pages = {342--352},
year = {1960},
url = {https://doi.org/10.1109/TEC.1960.5219857},
doi = {10.1109/TEC.1960.5219857},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/LawlerS60.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-14 23:14 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:
