Stathis Zachos at 70!
From MaRDI portal
Publication:5283390
DOI10.1007/978-3-319-57586-5_39zbMath1486.68007OpenAlexW2605929785WikidataQ59818362 ScholiaQ59818362MaRDI QIDQ5283390
Dimitris Fotakis, Nikolaos S. Papaspyrou, Costas D. Koutras, Christos Nomikos, Panagiotis Cheilaris, Aris Pagourtzis, Eleni Bakali, Euripides Markou, Katerina Potika, Christos H. Papadimitriou, Martin Fuerer
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_39
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered coloring of grids and related graphs
- Does co-NP have short interactive proofs ?
- Satisfying a maximum number of pre-routed requests in all-optical rings.
- Routing and path multicoloring
- The combinator S
- Maximizing the guarded boundary of an Art Gallery is APX-complete
- Path multicoloring with fewer colors in spiders and caterpillars
- Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
- Robustness of probabilistic computational complexity classes under definitional perturbations
- Randomized and Approximation Algorithms for Blue-Red Matching
- On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
- On the Connection between Interval Size Functions and Path Counting
- Many-valued reflexive autoepistemic logic
- A decisive characterization of BPP
- Selfish Resource Allocation in Optical Networks
- Completeness Results for Counting Problems with Easy Decision
- Graph isomorphism in quasipolynomial time [extended abstract]
- The Complexity of Computing the Size of an Interval
- The Complexity of Counting Functions with Easy Decision Version
- Counting classes: Thresholds, parity, mods, and fewness
This page was built for publication: Stathis Zachos at 70!
