%
% This file was created by the Typo3 extension
% sevenpack version 0.7.10
%
% --- Timezone: UTC
% Creation date: 2019-08-23
% Creation time: 17-57-44
% --- Number of references
% 52
%
@Article { HSV2017,
title = {Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm},
journal = {Mathematical Programming Computation},
year = {2017},
volume = {9},
number = {2},
pages = {135--202},
author = {Hougardy, Stefan and Silvanus, Jannik and Vygen, Jens}
}
@Article { MR3654287,
title = {Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm},
journal = {Math. Program. Comput.},
year = {2017},
volume = {9},
number = {2},
pages = {135--202},
DOI = {10.1007/s12532-016-0110-1},
author = {Hougardy, Stefan and Silvanus, Jannik and Vygen, Jens}
}
@Inproceedings { CHSS2017,
title = {Automatic Cell Layout in the 7nm Era},
year = {2017},
pages = {99--106},
booktitle = {ISPD '17 Proceedings of the 2017 ACM International Symposium on PhysicalDesign},
author = {Cremer, Pascal and Hougardy, Stefan and Schneider, Jan and Silvanus, Jannik}
}
@Article { Funke2016355,
title = {An exact algorithm for wirelength optimal placements in VLSI design},
journal = {Integration, the VLSI Journal},
year = {2016},
volume = {52},
pages = {355--366},
abstract = {Abstract We present a new algorithm designed to solve floorplanning problems optimally. More precisely, the algorithm finds solutions to rectangle packing problems which globally minimize wirelength and avoid given sets of blocked regions. We present the first optimal floorplans for 3 of the 5 intensely studied MCNC block packing instances and a significantly larger industrial instance with 27 rectangles and thousands of nets. Moreover, we show how to use the algorithm to place larger instances that cannot be solved optimally in reasonable runtime.},
DOI = {http://dx.doi.org/10.1016/j.vlsi.2015.07.001},
author = {Funke, J. and Hougardy, S. and Schneider, J.}
}
@Book { MR3560916,
title = {Algorithmic mathematics},
year = {2016},
pages = {xiii+163},
note = {Translated by Rabe von Randow},
publisher = {Springer, Cham},
ISBN = {978-3-319-39557-9; 978-3-319-39558-6},
author = {Hougardy, Stefan and Vygen, Jens}
}
@Article { MR3395096,
title = {On the nearest neighbor rule for the metric traveling salesman problem},
journal = {Discrete Appl. Math.},
year = {2015},
volume = {195},
pages = {101--103},
DOI = {10.1016/j.dam.2014.03.012},
author = {Hougardy, Stefan and Wilde, Mirko}
}
@Article { MR3346559,
title = {The approximation ratio of the greedy algorithm for the metric traveling salesman problem},
journal = {Oper. Res. Lett.},
year = {2015},
volume = {43},
number = {3},
pages = {259--261},
DOI = {10.1016/j.orl.2015.02.009},
author = {Brecklinghaus, Judith and Hougardy, Stefan}
}
@Book { HV2015,
title = {Algorithmische Mathematik},
year = {2015},
publisher = {Springer},
author = {Hougardy, Stefan and Vygen, Jens}
}
@Incollection { HHV2015,
title = {Chip Design},
year = {2015},
pages = {804--807},
editor = {N.J.Higham},
publisher = {Princeton University Press},
booktitle = {The Princeton Companion to Applied Mathematics},
author = {Held, Stephan and Hougardy, Stefan and Vygen, Jens}
}
@Article { MR3276369,
title = {On the integrality ratio of the subtour LP for Euclidean TSP},
journal = {Oper. Res. Lett.},
year = {2014},
volume = {42},
number = {8},
pages = {495--499},
DOI = {10.1016/j.orl.2014.08.009},
author = {Hougardy, Stefan}
}
@Incollection { MR3295876,
title = {Edge elimination in TSP instances},
year = {2014},
volume = {8747},
pages = {275--286},
publisher = {Springer, Cham},
series = {Lecture Notes in Comput. Sci.},
booktitle = {Graph-theoretic concepts in computer science},
DOI = {10.1007/978-3-319-12340-0_23},
author = {Hougardy, Stefan and Schroeder, Rasmus T.}
}
@Inproceedings { HNS2013,
title = {BonnCell: Automatic Layout of Leaf Cells},
year = {2013},
pages = {453--460},
booktitle = {Proceedings of the 18th Asia and South Pacific Design AutomationConference (ASPDAC) 2013},
author = {Hougardy, Stefan and Nieberg, Tim and Schneider, Jan}
}
@Inproceedings { Hou2012,
title = {A Scale Invariant Algorithm for Packing Rectangles Perfectly},
year = {2012},
booktitle = {Proceedings of the fourth International Workshop on Bin Packing andPlacement Constraints (BPPC'12)},
author = {Hougardy, Stefan}
}
@Inproceedings { FHS2012,
title = {Wirelength Optimal Rectangle Packings},
year = {2012},
booktitle = {Proceedings of the fourth International Workshop on Bin Packing andPlacement Constraints (BPPC'12)},
author = {Funke, Julia and Hougardy, Stefan and Schneider, Jan}
}
@Article { MR2805963,
title = {On packing squares into a rectangle},
journal = {Comput. Geom.},
year = {2011},
volume = {44},
number = {8},
pages = {456--463},
DOI = {10.1016/j.comgeo.2011.05.001},
author = {Hougardy, Stefan}
}
@Article { MR2649986,
title = {Surface realization with the intersection segment functional},
journal = {Experiment. Math.},
year = {2010},
volume = {19},
number = {1},
pages = {79--92},
author = {Hougardy, Stefan and Lutz, Frank H. and Zelke, Mariano}
}
@Article { MR2654960,
title = {The Floyd-Warshall algorithm on graphs with negative cycles},
journal = {Inform. Process. Lett.},
year = {2010},
volume = {110},
number = {8-9},
pages = {279--281},
DOI = {10.1016/j.ipl.2010.02.001},
author = {Hougardy, Stefan}
}
@Incollection { MR2513316,
title = {Linear time approximation algorithms for degree constrained subgraph problems},
year = {2009},
pages = {185--200},
publisher = {Springer, Berlin},
booktitle = {Research trends in combinatorial optimization},
DOI = {10.1007/978-3-540-76796-1_9},
author = {Hougardy, Stefan}
}
@Article { MR2365063,
title = {Computation of best possible low degree expanders},
journal = {Discrete Appl. Math.},
year = {2007},
volume = {155},
number = {18},
pages = {2539--2545},
DOI = {10.1016/j.dam.2007.06.023},
author = {Hougardy, Stefan and K{\~A}¶thnig, Ivo}
}
@Article { HLZ2007b,
title = {Polyhedra of Genus 2 with 10 Vertices and Minimal Coordinates},
year = {2007},
howpublished = {Electronic Geometry Model No. 2005.08.001},
author = {Hougardy, Stefan and H. Lutz, Frank and Zelke, Mariano}
}
@Article { HLKZ2007,
title = {Polyhedra of Genus 3 with 10 Vertices and Minimal Coordinates},
year = {2007},
howpublished = {Electronic Geometry Model No. 2006.02.001},
author = {Hougardy, Stefan and H. Lutz, Frank and Zelke, Mariano}
}
@Article { MR2230782,
title = {Approximating weighted matchings in parallel},
journal = {Inform. Process. Lett.},
year = {2006},
volume = {99},
number = {3},
pages = {119--123},
DOI = {10.1016/j.ipl.2006.03.005},
author = {Hougardy, Stefan and Vinkemeier, Doratha E.}
}
@Article { MR2261918,
title = {Classes of perfect graphs},
journal = {Discrete Math.},
year = {2006},
volume = {306},
number = {19-20},
pages = {2529--2571},
DOI = {10.1016/j.disc.2006.05.021},
author = {Hougardy, Stefan}
}
@Article { MR2206059,
title = {Lower bounds for the relative greedy algorithm for approximating Steiner trees},
journal = {Networks},
year = {2006},
volume = {47},
number = {2},
pages = {111--115},
DOI = {10.1002/net.20100},
author = {Hougardy, Stefan and Kirchner, Stefan}
}
@Article { MR2261792,
title = {On a conjecture of Ho{\~A} ng and Tu concerning perfectly orderable graphs},
journal = {Discrete Math.},
year = {2006},
volume = {306},
number = {22},
pages = {2962--2963},
DOI = {10.1016/j.disc.2005.09.023},
author = {Hougardy, Stefan}
}
@Article { MR2163133,
title = {A linear-time approximation algorithm for weighted matchings in graphs},
journal = {ACM Trans. Algorithms},
year = {2005},
volume = {1},
number = {1},
pages = {107--122},
DOI = {10.1145/1077464.1077472},
author = {Drake Vinkemeier, Doratha E. and Hougardy, Stefan}
}
@Article { MR2025884,
title = {On approximation algorithms for the terminal Steiner tree problem},
journal = {Inform. Process. Lett.},
year = {2004},
volume = {89},
number = {1},
pages = {15--18},
DOI = {10.1016/j.ipl.2003.09.014},
author = {Drake, Doratha E. and Hougardy, Stefan}
}
@Article { MR2057605,
title = {On simplicial and co-simplicial vertices in graphs},
journal = {Discrete Appl. Math.},
year = {2004},
volume = {138},
number = {1-2},
pages = {117--132},
note = {Optimal discrete structures and algorithms (ODSA 2000)},
DOI = {10.1016/S0166-218X(03)00275-0},
author = {Ho{\~A} ng, Ch{\~A}nh T. and Hougardy, Stefan and Maffray, Fr{\~A}©d{\~A}©ric and Mahadev, N. V. R.}
}
@Article { MR2114307,
title = {Perfectness is an elusive graph property},
journal = {SIAM J. Comput.},
year = {2004},
volume = {34},
number = {1},
pages = {109--117},
DOI = {10.1137/S0097539703426799},
author = {Hougardy, Stefan and Wagler, Annegret}
}
@Article { MR1950496,
title = {A simple approximation algorithm for the weighted matching problem},
journal = {Inform. Process. Lett.},
year = {2003},
volume = {85},
number = {4},
pages = {211--213},
DOI = {10.1016/S0020-0190(02)00393-9},
author = {Drake, Doratha E. and Hougardy, Stefan}
}
@Incollection { MR2080777,
title = {Improved linear time approximation algorithms for weighted matchings},
year = {2003},
volume = {2764},
pages = {14--23},
publisher = {Springer, Berlin},
series = {Lecture Notes in Comput. Sci.},
booktitle = {Approximation, randomization, and combinatorial optimization},
DOI = {10.1007/978-3-540-45198-3_2},
author = {Drake, Doratha E. and Hougardy, Stefan}
}
@Incollection { MR2052035,
title = {Linear time local improvements for weighted matchings in graphs},
year = {2003},
volume = {2647},
pages = {107--119},
publisher = {Springer, Berlin},
series = {Lecture Notes in Comput. Sci.},
booktitle = {Experimental and efficient algorithms},
DOI = {10.1007/3-540-44867-5_9},
author = {Drake, Doratha E. and Hougardy, Stefan}
}
@Article { MR1936943,
title = {Recursive generation of partitionable graphs},
journal = {J. Graph Theory},
year = {2002},
volume = {41},
number = {4},
pages = {259--285},
DOI = {10.1002/jgt.10067},
author = {Boros, E. and Gurvich, V. and Hougardy, S.}
}
@Article { MR1912628,
title = {Steiner trees in uniformly quasi-bipartite graphs},
journal = {Inform. Process. Lett.},
year = {2002},
volume = {83},
number = {4},
pages = {195--200},
DOI = {10.1016/S0020-0190(01)00335-0},
author = {Gr{\~A}¶pl, Clemens and Hougardy, Stefan and Nierhoff, Till and Pr{\~A}¶mel, Hans J{\~A}¼rgen}
}
@Inproceedings { hayward2002polynomial,
title = {Polynomial time recognition of P 4-structure},
year = {2002},
volume = {6},
number = {08},
pages = {382--389},
booktitle = {Symposium on Discrete Algorithms: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms},
organization = {Citeseer},
author = {Hayward, Ryan B. and Hougardy, Stefan and Reed, Bruce A.}
}
@Incollection { MR1945815,
title = {Approximation algorithms for the Steiner tree problem in graphs},
year = {2001},
volume = {11},
pages = {235--279},
publisher = {Kluwer Acad. Publ., Dordrecht},
series = {Comb. Optim.},
booktitle = {Steiner trees in industry},
DOI = {10.1007/978-1-4613-0255-1_7},
author = {Gr{\~A}¶pl, Clemens and Hougardy, Stefan and Nierhoff, Till and Pr{\~A}¶mel, Hans J{\~A}¼rgen}
}
@Incollection { MR1905634,
title = {Lower bounds for approximation algorithms for the Steiner tree problem},
year = {2001},
volume = {2204},
pages = {217--228},
publisher = {Springer, Berlin},
series = {Lecture Notes in Comput. Sci.},
booktitle = {Graph-theoretic concepts in computer science (Boltenhagen, 2001)},
DOI = {10.1007/3-540-45477-2_20},
author = {Gr{\~A}¶pl, Clemens and Hougardy, Stefan and Nierhoff, Till and Pr{\~A}¶mel, Hans J{\~A}¼rgen}
}
@Incollection { MR1861359,
title = {The P\(_{4}\)-structure of perfect graphs},
year = {2001},
pages = {93--112},
publisher = {Wiley, Chichester},
series = {Wiley-Intersci. Ser. Discrete Math. Optim.},
booktitle = {Perfect graphs},
author = {Hougardy, Stefan}
}
@Article { MR1684285,
title = {On wing-perfect graphs},
journal = {J. Graph Theory},
year = {1999},
volume = {31},
number = {1},
pages = {51--66},
DOI = {10.1002/(SICI)1097-0118(199901)30:1<51::AID-JGT6>3.0.CO;2-7},
author = {Hougardy, Stefan}
}
@Inproceedings { MR1739974,
title = {A 1.598 approximation algorithm for the Steiner problem in graphs},
year = {1999},
pages = {448--453},
publisher = {ACM, New York},
booktitle = {Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999)},
author = {Hougardy, Stefan and Pr{\~A}¶mel, Hans J{\~A}¼rgen}
}
@Article { MR1680092,
title = {Uniquely colourable graphs and the hardness of colouring graphs of large girth},
journal = {Combin. Probab. Comput.},
year = {1998},
volume = {7},
number = {4},
pages = {375--386},
DOI = {10.1017/S0963548398003678},
author = {Emden-Weinert, Thomas and Hougardy, Stefan and Kreuter, Bernd}
}
@Inproceedings { Hou1998,
title = {Proof Checking and Non-Approximability},
year = {1998},
volume = {1367},
pages = {63--82},
editor = {E.W.Mayr and H.J.Proemel and A.Steger},
series = {Lecture Notes in Computer Science},
booktitle = {Lectures on Proof Verification and Approximation Algorithms},
author = {Hougardy, Stefan}
}
@Article { MR1464581,
title = {Does the Jones polynomial detect unknottedness?},
journal = {Experiment. Math.},
year = {1997},
volume = {6},
number = {1},
pages = {51--56},
author = {Dasbach, Oliver T. and Hougardy, Stefan}
}
@Article { MR1439288,
title = {Perfect graphs with unique P\(_{4}\)-structure},
journal = {Discrete Math.},
year = {1997},
volume = {165/166},
pages = {421--430},
note = {Graphs and combinatorics (Marseille, 1995)},
DOI = {10.1016/S0012-365X(96)00188-4},
author = {Hougardy, Stefan}
}
@Article { MR1422562,
title = {Wing-triangulated graphs are perfect},
journal = {J. Graph Theory},
year = {1997},
volume = {24},
number = {1},
pages = {25--31},
DOI = {10.1002/(SICI)1097-0118(199701)24:1<25::AID-JGT4>3.0.CO;2-L},
author = {Hougardy, Stefan and Le, Van Bang and Wagler, Annegret}
}
@Article { MR1414091,
title = {A conjecture of Kauffman on amphicheiral alternating knots},
journal = {J. Knot Theory Ramifications},
year = {1996},
volume = {5},
number = {5},
pages = {629--635},
DOI = {10.1142/S0218216596000369},
author = {Dasbach, Oliver T. and Hougardy, Stefan}
}
@Article { MR1395466,
title = {Even pairs and the strong perfect graph conjecture},
journal = {Discrete Math.},
year = {1996},
volume = {154},
number = {1-3},
pages = {277--278},
DOI = {10.1016/0012-365X(94)00330-L},
author = {Hougardy, Stefan}
}
@Article { MR1399676,
title = {On the P\(_{4}\)-structure of perfect graphs. V. Overlap graphs},
journal = {J. Combin. Theory Ser. B},
year = {1996},
volume = {67},
number = {2},
pages = {212--237},
DOI = {10.1006/jctb.1996.0042},
author = {Ho{\~A} ng, Ch{\~A}nh T. and Hougardy, Stefan and Maffray, Fr{\~A}©d{\~A}©ric}
}
@Book { Hou1996,
title = {On the P\(_{4}\)-Structure of Perfect Graphs},
year = {1996},
publisher = {Shaker},
author = {Hougardy, Stefan}
}
@Article { MR1317198,
title = {Even and odd pairs in linegraphs of bipartite graphs},
journal = {European J. Combin.},
year = {1995},
volume = {16},
number = {1},
pages = {17--21},
DOI = {10.1016/0195-6698(95)90085-3},
author = {Hougardy, Stefan}
}
@Article { MR1313286,
title = {Probabilistically checkable proofs and their consequences for approximation algorithms},
journal = {Discrete Math.},
year = {1994},
volume = {136},
number = {1-3},
pages = {175--223},
note = {Trends in discrete mathematics},
DOI = {10.1016/0012-365X(94)00112-V},
author = {Hougardy, S. and Pr{\~A}¶mel, H. J. and Steger, A.}
}
@Article { MR1226145,
title = {Counterexamples to three conjectures concerning perfect graphs},
journal = {Discrete Math.},
year = {1993},
volume = {117},
number = {1-3},
pages = {245--251},
DOI = {10.1016/0012-365X(93)90338-T},
author = {Hougardy, Stefan}
}