default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 184
Volume 184, February 2024
- Reynaldo Gil Pons, Max Ward
, Loïc Miller:
Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard. 106433 - Pierre Hoppenot, Zoltán Szigeti:
On reversing arcs to improve arc-connectivity. 106434 - Sergey Kitaev, Artem V. Pyatkin:
On semi-transitive orientability of split graphs. 106435 - Shion Utsumi, Motoki Nakahashi, Kosei Sakamoto, Takanori Isobe:
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher. 106436 - Eduardo Sany Laber:
The computational complexity of some explainable clustering problems. 106437 - Lijing Zheng, Haibin Kan, Jie Peng, Yanjun Li, Yanbin Zheng:
A new class of generalized almost perfect nonlinear monomial functions. 106445 - Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman:
Relating planar graph drawings to planar satisfiability problems. 106446 - Xiaowei Li, Xiwen Lu:
The facility location problem with maximum distance constraint. 106447 - Guoliang Qiu, Jiaheng Wang:
Inapproximability of counting independent sets in linear hypergraphs. 106448 - Sebastian Maneth, Helmut Seidl:
Checking in polynomial time whether or not a regular tree language is deterministic top-down. 106449 - Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-connectivity for node failure identification in Boolean Network Tomography. 106450 - Sukanya Maji, Sanjib Sadhu:
Discrete and mixed two-center problems for line segments. 106451 - Daniel Gabric:
Ranking and unranking bordered and unbordered words. 106452
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 2025-03-12 23:21 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:
翻译：