Parliament seating assignment problems

[1]  Martin E. Dyer,et al.  On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..

[2]  Isabel Méndez-Díaz,et al.  A Polyhedral Approach for Graph Coloring1 , 2001, Electron. Notes Discret. Math..

[3]  Julien Darlay,et al.  Dense and sparse graph partition , 2012, Discret. Appl. Math..

[4]  Douglas M. King,et al.  Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning , 2015, Math. Program..

[5]  Keqin Li,et al.  Static Job Scheduling in Partitionable Mesh Connected Systems , 1990, J. Parallel Distributed Comput..

[6]  Shankar M. Venkatesan,et al.  Approximation and Intractability Results for the Maximum Cut Problem and its Variants , 1991, IEEE Trans. Computers.

[7]  Alessandro Saia.  Random interactions in the Chamber: Legislators' behavior and political distance , 2018, Journal of Public Economics.

[8]  Justo Puerto,et al.  Clustering data that are graph connected , 2017, Eur. J. Oper. Res..

[9]  M. Gallagher.  Proportionality, disproportionality and electoral systems , 1991 .

[10]  Yiming Wang,et al.  On imposing connectivity constraints in integer programs , 2017, Mathematical Programming.

[11]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[12]  Emir Kamenica,et al.  Peer Effects in Legislative Voting , 2019, American Economic Journal: Applied Economics.

[13]  Joseph Y.-T. Leung,et al.  Packing Squares into a Square , 1990, J. Parallel Distributed Comput..

[14]  Jeroen H. G. C. Rutten,et al.  Disconnecting graphs by removing vertices: a polyhedral approach , 2007 .

[15]  Martin Schmidt,et al.  Mixed-integer programming techniques for the connected max-k-cut problem , 2020, Mathematical Programming Computation.

[16]  Sascha Kurz.  Counting polyominoes with minimum perimeter , 2008, Ars Comb..

[17]  Norman J. Pullman,et al.  Clique coverings of graphs — A survey , 1983 .

[18]  Douglas M. King,et al.  Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning , 2012, Oper. Res..

[19]  Martin Schmidt,et al.  Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches , 2019, Optim. Methods Softw..

[20]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[21]  Takeshi Shirabe,et al.  Districting Modeling with Exact Contiguity Constraints , 2009 .