E-LIB Suche - Ergebnisse für: Su, Pascal

1

Mastermind with a linear number of queries:

Martinsson, Anders ; Su, Pascal
Combinatorics, Probability and Computing. 33 (2023) 2 - p. 143-156 , 2023

Link: https://doi.org/10.1017/..

2

K-factors in graphs with low independence number:

Knierim, Charlotte ; Su, Pascal
Journal of Combinatorial Theory, Series B. 148 (2021) - p. 60-83 , 2021

Link: https://doi.org/10.1016/..

3

Labeling Schemes for Nearest Common Ancestors through Minor..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,

Gawrychowski, Paweł ; Kuhn, Fabian ; Łopuszański, Jakub.. - p. 2604-2619 , 2018

Link: https://doi.org/10.1137/..

4

Labeling schemes for nearest common ancestors through minor..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,

Gawrychowski, Paweł ; Kuhn, Fabian ; Łopuszański, Jakub.. - p. 2604-2619 , 2018

Link: https://dl.acm.org/doi/1..

5

Bipartite Kneser Graphs are Hamiltonian:

Mütze, Torsten ; Su, Pascal
Combinatorica. 37 (2016) 6 - p. 1207-1219 , 2016

Link: https://doi.org/10.1007/..

6

Bipartite Kneser graphs are Hamiltonian:

Mütze, Torsten ; Su, Pascal
Electronic Notes in Discrete Mathematics. 49 (2015) - p. 259-267 , 2015

Link: https://doi.org/10.1016/..

7

Mastermind with a linear number of queries:

Martinsson, Anders ; Su, Pascal
info:eu-repo/semantics/altIdentifier/doi/10.1017/S0963548323000366. , 2024

Link: https://hdl.handle.net/2..

8

An O(N) time algorithm for finding hamilton cycles with hig..:

Nenadov, Rajko ; Steger, Angelika ; Su, Pascal
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.ITCS.2021.60. , 2021

Link: https://hdl.handle.net/2..

9

An O(N) Time Algorithm for Finding Hamilton Cycles with Hig..:

Nenadov, Rajko ; Steger, Angelika ; Su, Pascal
doi:10.4230/LIPIcs.ITCS.2021.60. , 2021

Link: https://doi.org/10.4230/..

10

Properties of Randomness in Graph Theory and Algorithms:

Su, Pascal
http://hdl.handle.net/20.500.11850/500860. , 2021

Link: https://hdl.handle.net/2..

11

An O(n) time algorithm for finding Hamilton cycles with hig..:

Nenadov, Rajko ; Steger, Angelika ; Su, Pascal
http://arxiv.org/abs/2012.02551. , 2020

Link: http://arxiv.org/abs/201..

12

Mastermind with a Linear Number of Queries:

Martinsson, Anders ; Su, Pascal
http://arxiv.org/abs/2011.05921. , 2020

Link: http://arxiv.org/abs/201..

13

The Chromatic Number of Dense Random Block Graphs:

Martinsson, Anders ; Panagiotou, Konstantinos ; Su, Pascal.
http://arxiv.org/abs/2007.07700. , 2020

Link: http://arxiv.org/abs/200..

14

Improved bounds on the multicolor Ramsey numbers of paths a..:

Knierim, Charlotte ; Su, Pascal
info:eu-repo/semantics/altIdentifier/wos/000463558300005. , 2019

Link: https://hdl.handle.net/2..

15

Improved Bounds on the Multicolor Ramsey Numbers of Paths a..:

Knierim, Charlotte ; Su, Pascal
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p26/pdf. , 2019

Link: https://www.combinatoric..