Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect de réir Cardinal, Jean, Demaine, Erik D., Eppstein, David, Hearn, Robert A., Winslow, Andrew

Faigh an téacs iomlán

The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs de réir Cardinal, Jean, Demaine, Erik D., Fiorini, Samuel, Joret, Gwenaël, Newman, Ilan, Weimann, Oren

Faigh an téacs iomlán
Faigh an téacs iomlán

Algorithmic folding complexity de réir Cardinal, Jean, Demaine, Erik D., Demaine, Martin L., Imahori, Shinji, Langerman, Stefan, Uehara, Ryuhei

Faigh an téacs iomlán
Faigh an téacs iomlán

The Stackelberg Minimum Spanning Tree Game de réir Cardinal, Jean, Demaine, Erik D, Fiorini, Samuel, Joret, Gwenaël, Langerman, Stefan, Newman, Ilan, Weimann, Oren

Faigh an téacs iomlán

Matching Points with Things de réir Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell, Maria, Seara, Carlos, Taslakian, Perouz, Demaine, Erik D., Demaine, Martin L.

Faigh an téacs iomlán
Faigh an téacs iomlán

Non-crossing matchings of points with geometric objects de réir Aloupis, Greg, Cardinal, Jean, Collette, Sebastien, Demaine, Erik D., Demaine, Martin L., Dulieu, Muriel, Fabila-Monroy, Ruy, Hart, Vi, Hurtado, Ferran, Langerman, Stefan, Saumell, Maria, Seara, Carlos, Taslakian, Perouz

Faigh an téacs iomlán
Faigh an téacs iomlán