Differences
This shows you the differences between two versions of the page.
|
staff:mutzel [2018-12-19 21:33] |
staff:mutzel [2019-01-11 14:16] |
||
|---|---|---|---|
| Line 98: | Line 98: | ||
| * **[[https://doi.org/10.7155/jgaa.00480| A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ // Nils M. Kriege, Andre Droschinsky, Petra Mutzel, Journal of Graph Algorithms and Applications// \\ vol. 22, no. 4, 607-616, 2018 | * **[[https://doi.org/10.7155/jgaa.00480| A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ // Nils M. Kriege, Andre Droschinsky, Petra Mutzel, Journal of Graph Algorithms and Applications// \\ vol. 22, no. 4, 607-616, 2018 | ||
| + | |||
| + | * On the Enumeration of Bicriteria Temporal Paths\\ // Lutz Oettershagen and Petra Mutzel // \\ Theory and Applications of Models of Computation (TAMC 2019), LNCS 11436, Springer, to appear 2019, also see [[https://arxiv.org/abs/1812.02507| CoRR abs/1812.02507]] | ||
| * **[[https://arxiv.org/abs/1806.10697|A new Integer Linear Program for the Steiner Tree Problem with Revenues, | * **[[https://arxiv.org/abs/1806.10697|A new Integer Linear Program for the Steiner Tree Problem with Revenues, | ||