default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 791
Volume 791, October 2019
- Changseong Jo, Jihoon Choi, Suh-Ryung Kim, Yoshio Sano:
On the minimum clique partitioning problem on weighted chordal graphs. 1-9 - Mamadou Moustapha Kanté, Thiago Braga Marcilon
, Rudini M. Sampaio:
On the parameterized complexity of the geodesic hull number. 10-27 - Richard Kueng, Dustin G. Mixon, Soledad Villar:
Fair redistricting is hard. 28-35 - Patrick Hartman, Joe Sawada:
Ranking and unranking fixed-density necklaces and Lyndon words. 36-47 - Takuro Fukunaga, Takanori Maehara:
Computing a tree having a small vertex cover. 48-61 - Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. 62-75 - Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon simplification by minimizing convex corners. 76-86 - Ran Ben Basat, Gil Einziger, Roy Friedman:
Give me some slack: Efficient network measurements. 87-108 - Margot Bruneaux:
A note about words which coincide except in one position. 109-111 - Jordi Recasens:
On a conjecture concerning positive semi-definiteness. 112-115 - Yuan Li, John O. Adeyeye:
Maximal sensitivity of Boolean nested canalizing functions. 116-122 - Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi:
Repetition avoidance in products of factors. 123-126 - Jeremy F. Alm, Andrew Ylvisaker:
A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over Z/pZ. 127-131 - Christopher Melekian, Eddie Cheng:
A note on generalized matching preclusion in bipartite graphs. 132-140
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-09-26 23:41 CEST 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:
