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

Get full text

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

Get full text
Get full text

Algorithmic folding complexity by Cardinal, Jean, Demaine, Erik D., Demaine, Martin L., Imahori, Shinji, Langerman, Stefan, Uehara, Ryuhei

Get full text
Get full text

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

Get full text

Matching Points with Things by 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.

Get full text
Get full text

Non-crossing matchings of points with geometric objects by 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

Get full text
Get full text