default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 170
Volume 170, September 2021
- Nir Halman, Shmuel Wimer
:
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions. 106114 - Marcos Oropeza, Csaba D. Tóth:
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees. 106116 - Abd El Fattah El Atik, Abdallah W. Aboutahoun, A. Elsaid:
Correct proof of the main result in "The number of spanning trees of a class of self-similar fractal models" by Ma and Yao. 106117 - Dusan Knop:
Local linear set on graphs with bounded twin cover number. 106118 - Takashi Ishizuka:
On the complexity of finding a Caristi's fixed point. 106119 - Jean-Lou De Carufel, Tanvir Kaykobad:
Transforming plane triangulations by simultaneous diagonal flips. 106120 - Florent Foucaud, Hervé Hocquard, Dimitri Lajou:
Complexity and algorithms for injective edge-coloring in graphs. 106121 - Yanger Ma, Tony Tan:
A simple combinatorial proof for the small model property of two-variable logic. 106122 - Saeed Akhoondian Amiri:
A note on the fine-grained complexity of MIS on regular graphs. 106123
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.
last updated on 2024-11-21 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
