Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 6846404

From MaRDI portal
Publication:4606302
Jump to:navigation, search

DOI10.4230/LIPICS.ESA.2016.33zbMATH Open1397.68096arXiv1607.08192MaRDI QIDQ4606302FDOQ4606302

Radu Curticapean

Publication date: 2 March 2018


Full work available at URL: https://arxiv.org/abs/1607.08192

Title of this publication is not available (Why is that?)


zbMATH Keywords

parameterized complexityplanar graphscounting complexitymatchings


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)



Cited In (1)

  • Compactors for parameterized counting problems






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606302)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4606302&oldid=18773520"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 14:02. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki