BibTeX records: Jeremias Weihmann

download as .bib file

@article{DBLP:journals/fuin/MayrW16,
  author       = {Ernst W. Mayr and
                  Jeremias Weihmann},
  title        = {Completeness Results for Generalized Communication-free Petri Nets
                  with Arbitrary Arc Multiplicities},
  journal      = {Fundam. Informaticae},
  volume       = {143},
  number       = {3-4},
  pages        = {355--391},
  year         = {2016},
  url          = {https://doi.org/10.3233/FI-2016-1318},
  doi          = {10.3233/FI-2016-1318},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/MayrW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/de/Weihmann15,
  author       = {Jeremias Weihmann},
  title        = {Generalized Petri Nets: Algorithms and Complexity (Generalisierte
                  Petrinetze: Algorithmen und Komplexit{\"{a}}t)},
  school       = {Technical University of Munich, Germany},
  year         = {2015},
  url          = {https://mediatum.ub.tum.de/1197299},
  urn          = {urn:nbn:de:bvb:91-diss-20150323-1197299-1-5},
  timestamp    = {Fri, 20 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/de/Weihmann15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fuin/MayrW15,
  author       = {Ernst W. Mayr and
                  Jeremias Weihmann},
  title        = {Complexity Results for Problems of Communication-Free Petri Nets and
                  Related Formalisms},
  journal      = {Fundam. Informaticae},
  volume       = {137},
  number       = {1},
  pages        = {61--86},
  year         = {2015},
  url          = {https://doi.org/10.3233/FI-2015-1170},
  doi          = {10.3233/FI-2015-1170},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fuin/MayrW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/TaubigW14,
  author       = {Hanjo T{\"{a}}ubig and
                  Jeremias Weihmann},
  title        = {Matrix power inequalities and the number of walks in graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {176},
  pages        = {122--129},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2013.10.002},
  doi          = {10.1016/J.DAM.2013.10.002},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/TaubigW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/apn/MayrW14,
  author       = {Ernst W. Mayr and
                  Jeremias Weihmann},
  editor       = {Gianfranco Ciardo and
                  Ekkart Kindler},
  title        = {A Framework for Classical Petri Net Problems: Conservative Petri Nets
                  as an Application},
  booktitle    = {Application and Theory of Petri Nets and Concurrency - 35th International
                  Conference, {PETRI} {NETS} 2014, Tunis, Tunisia, June 23-27, 2014.
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8489},
  pages        = {314--333},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-07734-5\_17},
  doi          = {10.1007/978-3-319-07734-5\_17},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/apn/MayrW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/TaubigWKHM13,
  author       = {Hanjo T{\"{a}}ubig and
                  Jeremias Weihmann and
                  Sven Kosub and
                  Raymond Hemmecke and
                  Ernst W. Mayr},
  title        = {Inequalities for the Number of Walks in Graphs},
  journal      = {Algorithmica},
  volume       = {66},
  number       = {4},
  pages        = {804--828},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00453-013-9766-3},
  doi          = {10.1007/S00453-013-9766-3},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/TaubigWKHM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/apn/MayrW13,
  author       = {Ernst W. Mayr and
                  Jeremias Weihmann},
  editor       = {Jos{\'{e}} Manuel Colom and
                  J{\"{o}}rg Desel},
  title        = {Results on Equivalence, Boundedness, Liveness, and Covering Problems
                  of BPP-Petri Nets},
  booktitle    = {Application and Theory of Petri Nets and Concurrency - 34th International
                  Conference, {PETRI} {NETS} 2013, Milan, Italy, June 24-28, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7927},
  pages        = {70--89},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-38697-8\_5},
  doi          = {10.1007/978-3-642-38697-8\_5},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/apn/MayrW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/rp/MayrW13,
  author       = {Ernst W. Mayr and
                  Jeremias Weihmann},
  editor       = {Parosh Aziz Abdulla and
                  Igor Potapov},
  title        = {Completeness Results for Generalized Communication-Free Petri Nets
                  with Arbitrary Edge Multiplicities},
  booktitle    = {Reachability Problems - 7th International Workshop, {RP} 2013, Uppsala,
                  Sweden, September 24-26, 2013 Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8169},
  pages        = {209--221},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-41036-9\_19},
  doi          = {10.1007/978-3-642-41036-9\_19},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/rp/MayrW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/analco/HemmeckeKMTW12,
  author       = {Raymond Hemmecke and
                  Sven Kosub and
                  Ernst W. Mayr and
                  Hanjo T{\"{a}}ubig and
                  Jeremias Weihmann},
  editor       = {Conrado Mart{\'{\i}}nez and
                  Hsien{-}Kuei Hwang},
  title        = {Inequalities for the Number of Walks in Graphs},
  booktitle    = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
                  {ANALCO} 2012, Kyoto, Japan, January 16, 2012},
  pages        = {26--39},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973020.4},
  doi          = {10.1137/1.9781611973020.4},
  timestamp    = {Tue, 23 May 2017 01:10:31 +0200},
  biburl       = {https://dblp.org/rec/conf/analco/HemmeckeKMTW12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.