Publication | Date of Publication | Type |
---|
Modifying networks to obtain low cost trees | 2024-06-05 | Paper |
Complexity and approximability of certain bicriteria location problems | 2024-02-28 | Paper |
Compact location problems with budget and communication constraints | 2023-12-12 | Paper |
Improving spanning trees by upgrading nodes | 2018-07-04 | Paper |
Graphentheoretische Konzepte und Algorithmen | 2012-10-02 | Paper |
Optimizing cost flows by edge cost and capacity upgrade | 2007-04-26 | Paper |
Multiple voting location and single voting location on trees | 2007-04-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5314567 | 2005-09-05 | Paper |
Upgrading trees under diameter and budget constraints | 2003-03-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q2766675 | 2002-07-09 | Paper |
On the flow cost lowering problem | 2002-06-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3147669 | 2002-01-01 | Paper |
Upgrading bottleneck constrained forests | 2001-10-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4494412 | 2000-08-10 | Paper |
Improving Minimum Cost Spanning Trees by Upgrading Nodes | 2000-02-06 | Paper |
Improving spanning trees by upgrading nodes | 2000-01-12 | Paper |
Approximation algorithms for certain network improvement problems | 1999-03-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4232790 | 1999-03-15 | Paper |
Modifying edges of a network to obtain short subgraphs | 1999-01-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4359752 | 1998-10-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4395331 | 1998-08-04 | Paper |
Compact location problems | 1998-07-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4359755 | 1998-04-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4888438 | 1996-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4293638 | 1994-05-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4293770 | 1994-05-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q3139123 | 1994-03-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3139122 | 1993-11-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4035760 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4035761 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3477939 | 1990-01-01 | Paper |
On separable clusterings | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3805894 | 1988-01-01 | Paper |
Clustering methods for geometric objects and applications to design problems | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3675496 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3965548 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3902475 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3911366 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3920679 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3935438 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4165408 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4065564 | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4082567 | 1976-01-01 | Paper |
Reduktion von Präzedenzstrukturen | 1976-01-01 | Paper |
An algorithm for the determination of longest distances in a graph | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4060728 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4070625 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4404399 | 1972-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5670442 | 1972-01-01 | Paper |
Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator) | 1971-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5624980 | 1971-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5603732 | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5609867 | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5578726 | 1969-01-01 | Paper |
Zum Auswahlproblem | 1968-01-01 | Paper |
Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen | 1968-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5588303 | 1968-01-01 | Paper |