Simple view

Full metadata view

Authors

Statistics

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems

2025
book section
conference proceedings
10.1109/LICS65433.2025.00037
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Author
Brunar Johanna

Kozik Marcin

Nagy Tomáš

Pinsker Michael
Editor
Nunez Martha
Book title / Journal title
2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Place
Piscataway, NJLos Alamitos, CATokyo
Publisher
IEEE Service CenterIEEE Computer SocietyIEEE Computer Society
Pages
403–416
ISBN
979-8-3315-7901-2979-8-3315-5464-4
eISBN
979-8-3315-7900-5
Series
Proceedings - Symposium on Logic in Computer Science
Serie's ISSN
1043-6871
Serie's eISSN
2575-5528
Language
English
Book language / Journal language
English
Conference
40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
200
Conference short name
LICS 2025
Conference start date
2025-06-23
End date conference
2025-06-26
Conference city
Singapur
Conference country
Singapur
Conference type
international
Affiliation
Wydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
dc.affiliationWydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
dc.conference40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
dc.conference.citySingapur
dc.conference.countrySingapur
dc.conference.datefinish2025-06-26
dc.conference.datestart2025-06-23
dc.conference.seriesIEEE Symposium on Logic in Computer Science
dc.conference.seriesshortcutLICS
dc.conference.seriesweblinkhttps://lics.siglog.org/
dc.conference.shortcutLICS 2025
dc.conference.weblinkhttps://lics.siglog.org/lics25/
dc.contributor.authorBrunar, Johanna
dc.contributor.authorKozik, Marcin - 129358
dc.contributor.authorNagy, Tomáš - 497415
dc.contributor.authorPinsker, Michael
dc.contributor.editorNunez, Martha
dc.date.accessioned2025-12-19T07:21:04Z
dc.date.available2025-12-19T07:21:04Z
dc.date.createdat2025-12-18T07:49:40Zen
dc.date.issued2025
dc.description.conftypeinternational
dc.description.physical403–416
dc.description.seriesProceedings - Symposium on Logic in Computer Science
dc.identifier.doi10.1109/LICS65433.2025.00037
dc.identifier.eisbn979-8-3315-7900-5
dc.identifier.isbn979-8-3315-7901-2
dc.identifier.isbn979-8-3315-5464-4
dc.identifier.serieseissn2575-5528
dc.identifier.seriesissn1043-6871
dc.identifier.urihttps://ruj.uj.edu.pl/handle/item/567924
dc.languageeng
dc.language.containereng
dc.placePiscataway, NJ
dc.placeLos Alamitos, CA
dc.placeTokyo
dc.publisherIEEE Service Center
dc.publisherIEEE Computer Society
dc.publisherIEEE Computer Society
dc.publisher.ministerialInstitute of Electrical and Electronics Engineers (IEEE)
dc.rightsDodaję tylko opis bibliograficzny
dc.rights.licenceBez licencji otwartego dostępu
dc.source.integratorfalse
dc.subtypeConferenceProceedings
dc.titleThe sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
dc.title.container2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
dc.typeBookSection
dspace.entity.typePublicationen
dc.affiliation
Wydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
dc.conference
40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
dc.conference.city
Singapur
dc.conference.country
Singapur
dc.conference.datefinish
2025-06-26
dc.conference.datestart
2025-06-23
dc.conference.series
IEEE Symposium on Logic in Computer Science
dc.conference.seriesshortcut
LICS
dc.conference.seriesweblink
https://lics.siglog.org/
dc.conference.shortcut
LICS 2025
dc.conference.weblink
https://lics.siglog.org/lics25/
dc.contributor.author
Brunar, Johanna
dc.contributor.author
Kozik, Marcin - 129358
dc.contributor.author
Nagy, Tomáš - 497415
dc.contributor.author
Pinsker, Michael
dc.contributor.editor
Nunez, Martha
dc.date.accessioned
2025-12-19T07:21:04Z
dc.date.available
2025-12-19T07:21:04Z
dc.date.createdaten
2025-12-18T07:49:40Z
dc.date.issued
2025
dc.description.conftype
international
dc.description.physical
403–416
dc.description.series
Proceedings - Symposium on Logic in Computer Science
dc.identifier.doi
10.1109/LICS65433.2025.00037
dc.identifier.eisbn
979-8-3315-7900-5
dc.identifier.isbn
979-8-3315-7901-2
dc.identifier.isbn
979-8-3315-5464-4
dc.identifier.serieseissn
2575-5528
dc.identifier.seriesissn
1043-6871
dc.identifier.uri
https://ruj.uj.edu.pl/handle/item/567924
dc.language
eng
dc.language.container
eng
dc.place
Piscataway, NJ
dc.place
Los Alamitos, CA
dc.place
Tokyo
dc.publisher
IEEE Service Center
dc.publisher
IEEE Computer Society
dc.publisher
IEEE Computer Society
dc.publisher.ministerial
Institute of Electrical and Electronics Engineers (IEEE)
dc.rights
Dodaję tylko opis bibliograficzny
dc.rights.licence
Bez licencji otwartego dostępu
dc.source.integrator
false
dc.subtype
ConferenceProceedings
dc.title
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
dc.title.container
2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
dc.type
BookSection
dspace.entity.typeen
Publication
Affiliations
No affiliation
Brunar, Johanna
Pinsker, Michael
Nunez, Martha
Wydział Matematyki i Informatyki
Kozik, Marcin
Nagy, Tomáš
computer and information sciences

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
17
Views per month
Views per city
Krakow
11
Warsaw
1

No access

No Thumbnail Available
Collections
Research publications