undefined

< Back to search results

Generalizing Brooks’ Theorem via Partial Coloring Is Hard Classically and Locally

Year of publication

2026

Authors

Bok, Jan; Das, Avinandan; Gujgiczer, Anna; Jedličková, Nikola

Organizations and authors

Aalto University

Das Avinandan

Publication type

Publication format

Article

Parent publication type

Conference

Article type

Other article

Audience

Scientific

Peer-reviewed

Peer-Reviewed

MINEDU's publication type classification code

A4 Article in conference proceedings

Publication channel information

Journal/Series

Lecture Notes in Computer Science

Parent publication name

WALCOM : Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Proceedings

Conference

International Conference and Workshops on Algorithms and Computation

Publisher

SPRINGER

Volume

16444 LNCS

Pages

247-262

ISSN

0302-9743

ISBN

978-981-95-7126-0

​Publication forum

62555

​Publication forum level

1

Open access

Open access in the publisher’s service

No

Self-archived

Yes

Other information

Fields of science

Computer and information sciences

Identified topic

[object Object]

Internationality of the publisher

International

Language

English

International co-publication

Yes

Co-publication with a company

No

DOI

10.1007/978-981-95-7127-7_17

The publication is included in the Ministry of Education and Culture’s Publication data collection

Yes