---
title: "mkoeppe/cutgeneratingfunctionology: papers citing it"
description: "4 papers in the tracked journals link to the GitHub repository mkoeppe/cutgeneratingfunctionology in their Crossref records, the first in 2016; most of them (1) in 2020."
url: https://scholar4ai.com/code/github-mkoeppe-cutgeneratingfunctionology
markdown_url: https://scholar4ai.com/code/github-mkoeppe-cutgeneratingfunctionology.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "4 papers in the tracked journals link to the GitHub repository mkoeppe/cutgeneratingfunctionology in their Crossref records, the first in 2016; most of them (1) in 2020. (as of 2026-11-03)"
data_url: https://scholar4ai.com/data/rankings.json
updated: 2026-11-03T14:43:26+09:00
window: 2026-10-05 to 2026-11-03
source: OpenAlex (CC0)
---

# mkoeppe/cutgeneratingfunctionology: papers linking to it

Research papers in the 480 tracked journals that link to mkoeppe/cutgeneratingfunctionology (https://github.com/mkoeppe/cutgeneratingfunctionology), read from their Crossref records: by year, category and journal, the family tree of papers building on one another, and the linked repositories derived from it or that it derives from.

- GitHub
- 13 stars
- 11 forks
- Sage
- license GPL-2.0
- created 2014
- https://github.com/mkoeppe/cutgeneratingfunctionology

All repositories: https://scholar4ai.com/code.md

## Key findings

- 4 papers in the tracked journals link to the GitHub repository mkoeppe/cutgeneratingfunctionology in their Crossref records, the first in 2016; most of them (1) in 2020.
- By category: Operations Research (4); the journals with the most are Mathematical Programming (2), Discrete Optimization (1) and Mathematical Programming Computation (1).
- 4 of the papers build on one another: a later paper cites an earlier one that also links mkoeppe/cutgeneratingfunctionology.

## By year

*Papers linking to mkoeppe/cutgeneratingfunctionology by publication year*

| Year | Papers |
|---|---:|
| 2016 | 1 |
| 2017 | 1 |
| 2018 | 1 |
| 2020 | 1 |

## Journals

*Journals whose papers link to mkoeppe/cutgeneratingfunctionology most*

| Journal | Papers |
|---|---:|
| [Mathematical Programming](https://scholar4ai.com/journals/mathematical-programming.md) | 2 |
| [Discrete Optimization](https://scholar4ai.com/journals/discrete-optimization.md) | 1 |
| [Mathematical Programming Computation](https://scholar4ai.com/journals/mathematical-programming-computation.md) | 1 |

## Family tree

Each paper sits under the earlier paper it builds on.

- [New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem](https://doi.org/10.1007/s12532-016-0115-9) (Mathematical Programming Computation, 2016)
  - [Extreme functions with an arbitrary number of slopes](https://doi.org/10.1007/s10107-017-1184-x) (Mathematical Programming, 2017) — cites the paper above
- [Equivariant perturbation in Gomory and Johnson’s infinite group problem. VI. The curious case of two-sided discontinuous minimal valid functions](https://doi.org/10.1016/j.disopt.2018.05.003) (Discrete Optimization, 2018)
  - [Facets, weak facets, and extreme functions of the Gomory–Johnson infinite group problem](https://doi.org/10.1007/s10107-020-01477-2) (Mathematical Programming, 2020) — cites the paper above

## Papers

*Papers linking to mkoeppe/cutgeneratingfunctionology, most cited first*

| Published | Title | Journal | Authors | Citations | Link |
|---|---|---|---|---:|---|
| 2016-11-24 | [New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem](https://doi.org/10.1007/s12532-016-0115-9) | [Mathematical Programming Computation](https://scholar4ai.com/journals/mathematical-programming-computation.md) | Matthias Köppe, Yuan Zhou | 12 | cites it |
| 2017-07-31 | [Extreme functions with an arbitrary number of slopes](https://doi.org/10.1007/s10107-017-1184-x) | [Mathematical Programming](https://scholar4ai.com/journals/mathematical-programming.md) | Amitabh Basu, Michele Conforti, Marco Di Summa et al. | 4 | cites it |
| 2018-07-03 | [Equivariant perturbation in Gomory and Johnson’s infinite group problem. VI. The curious case of two-sided discontinuous minimal valid functions](https://doi.org/10.1016/j.disopt.2018.05.003) | [Discrete Optimization](https://scholar4ai.com/journals/discrete-optimization.md) | Matthias Köppe, Yuan Zhou | 4 | cites it |
| 2020-02-28 | [Facets, weak facets, and extreme functions of the Gomory–Johnson infinite group problem](https://doi.org/10.1007/s10107-020-01477-2) | [Mathematical Programming](https://scholar4ai.com/journals/mathematical-programming.md) | Matthias Köppe, Yuan Zhou | 0 | cites it |

## How this is measured

Links are read from each paper's Crossref record as its publisher deposited it: the URLs and repository DOIs in its reference list (the software and data it cites) and its supplementary links (“is-supplemented-by”: its own code or data). A paper that gives its code only in the text, a footnote or a data availability statement is not counted, and some publishers deposit reference lists without their URLs, so every count here is a lower bound. Repository details come from the GitHub REST API (stars, forks, and the repository a fork was made from), the Hugging Face Hub API (likes, downloads, and the base model a model was derived from) and DataCite (Zenodo and other data DOIs, and the GitHub release a Zenodo record archives), read again every month.

## Cite this page

Scholar4AI. (2026). mkoeppe/cutgeneratingfunctionology: papers linking to it. Journal and Conference Research Rankings. Retrieved November 3, 2026, from https://scholar4ai.com/code/github-mkoeppe-cutgeneratingfunctionology

```bibtex
@misc{scholar4ai-code-github-mkoeppe-cutgeneratingfunctionology,
  author = {{Scholar4AI}},
  title = {mkoeppe/cutgeneratingfunctionology: papers linking to it},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/code/github-mkoeppe-cutgeneratingfunctionology}},
  urldate = {2026-11-03},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}
```

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).