sdopt-tearing/CITATION at master · baharev/sdopt-tearing · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
..
   This file is part of sdopt-tearing https://github.com/baharev/sdopt-tearing,
   and is Copyright (C) 2015-2016 the University of Vienna.
   It is licensed under the three-clause BSD license; see LICENSE.
   Contact: ali.baharev@gmail.com

   Redistribution and use in source and binary forms, with or without
   modification, are permitted provided that the following conditions are
   met:

    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.

    * Redistributions in binary form must reproduce the above
      copyright notice, this list of conditions and the following
      disclaimer in the documentation and/or other materials provided
      with the distribution.

    * Neither the name of the University of Vienna nor the names
      of its contributors may be used to endorse or promote products
      derived from this software without specific prior written
      permission.

   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
   HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

*********
Citations
*********

Software Citation
=================

If you use the sdopt-tearing software, please cite the relevant paper(s):

  - `Decomposition methods for solving nonlinear systems of equations <https://baharev.info/publications/baharev_tearing_survey.pdf>`_
  - `Ordering matrices to bordered lower triangular form with minimal border width <https://baharev.info/publications/baharev_tearing_exact_algorithm.pdf>`_
  - `An exact method for the minimum feedback arc set problem <https://baharev.info/publications/baharev_minimum_feedback_arc_set.pdf>`_

.. code-block:: tex

    @ARTICLE{tearing-survey,
      AUTHOR = {A. Baharev and H. Schichl and A. Neumaier},
      TITLE = {Decomposition methods for solving nonlinear systems of equations},
      YEAR = {2016},
      URL = {https://baharev.info/publications/baharev\_tearing\_survey.pdf},
      NOTE = {Submitted}
    }

    @ARTICLE{tearing-exact,
      AUTHOR = {A. Baharev and H. Schichl and A. Neumaier},
      TITLE = {Ordering matrices to bordered lower triangular form with minimal border width},
      YEAR = {2016},
      URL = {https://baharev.info/publications/baharev\_tearing\_exact\_algorithm.pdf},
      NOTE = {Submitted}
    }

    @ARTICLE{mfes,
        author = {Baharev, Ali and Schichl, Hermann and Neumaier, Arnold and Achterberg, Tobias},
        title = {An Exact Method for the Minimum Feedback Arc Set Problem},
        year = {2021},
        issue_date = {December 2021},
        publisher = {Association for Computing Machinery},
        address = {New York, NY, USA},
        volume = {26},
        issn = {1084-6654},
        url = {https://doi.org/10.1145/3446429},
        doi = {10.1145/3446429},
        journal = {ACM J. Exp. Algorithmics},
        month = {apr},
        articleno = {1.4},
        numpages = {28},
        keywords = {minimum feedback vertex set, maximum acyclic subgraph, minimum feedback arc set, tearing, Linear ordering problem}
    }

}