Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             10 results found
no title author magazine year volume issue page(s) type
1 A note on the fine-grained complexity of MIS on regular graphs Akhoondian Amiri, Saeed
170 C p.
 article
2 A simple combinatorial proof for the small model property of two-variable logic Ma, Yanger
170 C p.
 article
3 Complexity and algorithms for injective edge-coloring in graphs Foucaud, Florent
170 C p.
 article
4 Correct proof of the main result in “The number of spanning trees of a class of self-similar fractal models” by Ma and Yao El Atik, Abd El Fattah A.
170 C p.
 article
5 Editorial Board
170 C p.
 article
6 Local linear set on graphs with bounded twin cover number Knop, Dušan
170 C p.
 article
7 On the complexity of finding a Caristi's fixed point Ishizuka, Takashi
170 C p.
 article
8 Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees Oropeza, Marcos
170 C p.
 article
9 Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions Halman, Nir
170 C p.
 article
10 Transforming plane triangulations by simultaneous diagonal flips De Carufel, Jean-Lou
170 C p.
 article
                             10 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands