Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Previous revision
staff:kriege [2018-11-22 16:32]
staff:kriege [2018-12-10 09:29]
Line 1: Line 1:
 ~~NOTOC~~ ~~NOTOC~~
 {{ http://​ls11-www.cs.tu-dortmund.de/​people/​kriege/​kriege.jpg}} {{ http://​ls11-www.cs.tu-dortmund.de/​people/​kriege/​kriege.jpg}}
-==== Nils M. Kriege ====+==== Nils Kriege ====
  
 | Room: | 237 | | Room: | 237 |
Line 92: Line 92:
  
 === Preprints === === Preprints ===
 +  * **[[https://​arxiv.org/​abs/​1812.03074|Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs]]** \\ Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling, ''​arXiv:​1812.03074''​.
 +
   * **[[https://​doi.org/​10.7287/​peerj.preprints.26612v1|Protein Complex Similarity based on Weisfeiler-Lehman labeling]]** \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ PeerJ Preprints, vol. 6, e26612v1, 2018.   * **[[https://​doi.org/​10.7287/​peerj.preprints.26612v1|Protein Complex Similarity based on Weisfeiler-Lehman labeling]]** \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ PeerJ Preprints, vol. 6, e26612v1, 2018.
  
Line 97: Line 99:
  
   * **[[https://​arxiv.org/​abs/​1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''​arXiv:​1612.05531''​.   * **[[https://​arxiv.org/​abs/​1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''​arXiv:​1612.05531''​.
- 
-  * **[[https://​arxiv.org/​abs/​1805.10754|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel, ''​arXiv:​1805.10754''​. 
  
  
 === Journal Articles === === Journal Articles ===
 +  * **A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs** (Preprint [[https://​arxiv.org/​abs/​1805.10754|arXiv:​1805.10754]]) \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel \\ Journal of Graph Algorithms and Applications (JGAA), accepted for publication.
 +
   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** (Preprint [[http://​arxiv.org/​abs/​1708.02772|arXiv:​1708.02772]]) \\ Nils Kriege, Florian Kurpicz, Petra Mutzel \\ European Journal on Combinatorics (EJC), vol. 68, 79-95, 2018.   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** (Preprint [[http://​arxiv.org/​abs/​1708.02772|arXiv:​1708.02772]]) \\ Nils Kriege, Florian Kurpicz, Petra Mutzel \\ European Journal on Combinatorics (EJC), vol. 68, 79-95, 2018.
  
 
Last modified: 2020-07-20 10:01 by Nils Kriege
DokuWikiRSS-Feed